{"component": "clause", "props": {"groups": [{"size": 3, "samples": [{"hash": "eHGeF2VNSd8", "uri": "/contracts/eHGeF2VNSd8#technical-overview", "label": "Software License Agreement", "score": 31.7616081238, "published": true}, {"hash": "3WZPXXYrL91", "uri": "/contracts/3WZPXXYrL91#technical-overview", "label": "Software License Agreement", "score": 31.7342338562, "published": true}, {"hash": "7LxtjRaMSpv", "uri": "/contracts/7LxtjRaMSpv#technical-overview", "label": "Software License Agreement", "score": 29.6483592987, "published": true}], "snippet": "at the commencement of this Agreement, the Licensor undertakes to provide technical overview, and materials in relation to the use of the Software, to nominated employees of the Licensee, such overview and materials to be determined at the discretion of the Licensor.", "snippet_links": [{"key": "commencement-of-this-agreement", "type": "clause", "offset": [7, 37]}, {"key": "the-licensor", "type": "clause", "offset": [39, 51]}, {"key": "to-provide", "type": "clause", "offset": [63, 73]}, {"key": "in-relation-to", "type": "clause", "offset": [108, 122]}, {"key": "use-of-the-software", "type": "clause", "offset": [127, 146]}, {"key": "the-licensee", "type": "definition", "offset": [174, 186]}, {"key": "to-be-determined", "type": "clause", "offset": [216, 232]}], "hash": "5f41e0d4ee916711fccf6d04659f9960", "id": 1}, {"size": 3, "samples": [{"hash": "2hJqf9WCq0c", "uri": "/contracts/2hJqf9WCq0c#technical-overview", "label": "Byzantine Agreement", "score": 26.2648868561, "published": true}], "snippet": "\u200c We now proceed to present our results in greater detail. The primitive\u2014succinctly reconstructed distributed signatures (SRDS)\u2014is a new type of a dis- tributed signature scheme, with a natural motivation: allowing a set of parties to jointly produce a signature on some message m, which can serve as a succinct certi\ufb01cate for proving that a ma- jority of the parties agree on m. Interestingly, this task does not seem to be attained by existing distributed signature notions, such as multi-signatures [60], aggregate signatures [12], or threshold signatures [43]. For example, while multi-signatures (and, similarly, aggregate signatures) can suc- cinctly combine signatures of many parties, to verify the signature, the (length-\u0398(n)!) vector of contributing-parties identities must also be communicated.4 As discussed in the related-work sec- tion (Section 1.3), threshold signatures are implied by SRDS but also do not su\ufb03ce: while identities of the signers are no longer needed to verify a combined signature, this information is necessary to reconstruct the combined signature in the \ufb01rst place (even within speci\ufb01c existing schemes, e.g., [50, 10]). We provide a more detailed comparison to di\ufb00erent signature notions in Section 1.3. An SRDS scheme is based on a PKI for signatures, where every party is set with a secret signing key and a public veri\ufb01cation key.5 The parties may receive additional setup information that may contain, for example, public parameters for the signature scheme or a common random string (CRS), depending on the actual construction. Given a message m, every party can locally generate a signature on m, and signatures on the same message can be succinctly aggregated into a new signature. The new aspect is that given a combined signature and a message m, it is possible to verify whether is was aggregated from a \u201clarge\u201d number of \u201cbase\u201d signatures on m, and both aggregation and veri\ufb01cation can be done succinctly. Three properties are required from an SRDS scheme: robustness means that the adversary can- not prevent the honest parties from generating an accepting signature on a message; unforgeability prevents the adversary controlling a minority from forging a signature; and succinctness requires that the \u201c\ufb01nal\u201d signature (including all information needed for veri\ufb01cation) is short (of size O\u02dc(1)) and can be incrementally reconstructed from \u201cbase\u201d signatures in small batches of size polylog(n).6 An SRDS scheme is t-secure if it satis\ufb01es the above properties even facing t colluding parties.", "snippet_links": [{"key": "our-results", "type": "clause", "offset": [28, 39]}, {"key": "type-of", "type": "definition", "offset": [137, 144]}, {"key": "the-parties-agree", "type": "clause", "offset": [356, 373]}, {"key": "for-example", "type": "definition", "offset": [565, 576]}, {"key": "to-verify", "type": "definition", "offset": [693, 702]}, {"key": "section-13", "type": "clause", "offset": [851, 862]}, {"key": "existing-schemes", "type": "definition", "offset": [1121, 1137]}, {"key": "provide-a", "type": "definition", "offset": [1159, 1168]}, {"key": "based-on", "type": "clause", "offset": [1258, 1266]}, {"key": "may-contain", "type": "definition", "offset": [1429, 1440]}, {"key": "depending-on-the", "type": "clause", "offset": [1531, 1547]}, {"key": "number-of", "type": "definition", "offset": [1858, 1867]}, {"key": "information-needed", "type": "clause", "offset": [2283, 2301]}], "hash": "1519ad0389f7f832ae10caf949cbb48e", "id": 2}, {"size": 2, "samples": [{"hash": "jGAXjbzl6cU", "uri": "/contracts/jGAXjbzl6cU#technical-overview", "label": "Cloud Services Reseller Agreement Special Addendum", "score": 26.9209251404, "published": true}, {"hash": "cFZI71OCFeY", "uri": "/contracts/cFZI71OCFeY#technical-overview", "label": "Cloud Services Reseller Agreement Special Addendum", "score": 23.9609851837, "published": true}], "snippet": "The GoldSeal VaaS offer functions as a standalone Virtual Meeting Room (\u201cVMR\u201d) for meeting participants to connect via video and audio across the open Internet. VMR features include: \u2022 Reservation-less, standard definition and high definition (up to 1080p30) video and audio conferencing with content sharing \u2022 Accessible by Polycom end-point portfolio, both hard and soft clients \u2022 H.323 and SIP standards-based connectivity \u2022 Browser-based soft client video endpoint support through web real-time communication (WebRTC) Interoperability with Lync endpoints available through Open Federation for Microsoft\u00ae Lync \u2022 Access to free versions of Polycom\u00ae RealPresence\u00ae Desktop and Polycom\u00ae RealPresence\u00ae Mobile o Soft clients available to employees (\u201cInternal Users\u201d) within a subscribing enterprise \u2022 Content sharing enabled through access to free versions of Polycom\u2019s People+Content IP application \u2022 US and EMEA toll based audio dial-in access \u2022 Each VMR instance is assigned by the VMR system administrator, to a specific individual who is the owner and host of that VMR. Each VMR includes a unique bridge number and customer-enabled PIN code. \u2022 Soft endpoint registration included with VMRs, hard endpoint registration services available separately as an option for an additional fee. \u2022 Point-to-point dialing, dial-in and dial-out services available for registered endpoints \u2022 A end-user Portal is provided as an online resource for GoldSeal VaaS users to access support resources, including dialing instructions, documentation, live conference control capabilities, FAQs and access to submit support questions to our GoldSeal Technical Support team. \u2022 Demo and Trial services are offered free of charge to allow customers to try the service before they buy \u2022 Enterprise user license (\u201cEUL\u201d) - an \u201call-you-can-eat\u201d VMR subscription with no overage fees, assigned to an individual user, for up to 25 participants per session o As an extension of EUL, Enterprise Wide Licensing is also available for parent company's willing to commit to the strategic growth and standardization of video technology across their complete user based. o Enterprise Wide pricing is only available in prepaid 1, 2 or 3 year plans. Contact us to see if you qualify \u2022 Fixed Capacity VMR is a VMR subscription service intended to be shared among teams. The Fixed Capacity VMR service has 3 different offerings based on the number of participants (up to 5, 10 or 25 participants), without overage fees \u2022 Endpoint Subscription (optional for an additional fee) \u2013 allows hard endpoints (physical codec units) to register to the VaaS platform and be reflected in the customer directory. Endpoints can then dial point-to- point, dial directly to off-net resources, receive calls directly from off-net resources and dial to VMRs using a short dial strings. o Directory services available to up to 6 registered endpoints. \u2022 Monthly subscriptions services require an activation fee per service initiation o The activation fee is waived for the corresponding pre-paid annual service. Meeting participants connect into a VMR via a unique dial string, H.323, SIP, WebRTC, audio or Lync.", "snippet_links": [{"key": "meeting-room", "type": "clause", "offset": [58, 70]}, {"key": "meeting-participants", "type": "clause", "offset": [83, 103]}, {"key": "the-open", "type": "clause", "offset": [142, 150]}, {"key": "standard-definition", "type": "definition", "offset": [203, 222]}, {"key": "high-definition", "type": "clause", "offset": [227, 242]}, {"key": "audio-conferencing", "type": "clause", "offset": [269, 287]}, {"key": "content-sharing", "type": "clause", "offset": [293, 308]}, {"key": "video-endpoint", "type": "definition", "offset": [454, 468]}, {"key": "access-to", "type": "definition", "offset": [615, 624]}, {"key": "free-versions", "type": "definition", "offset": [625, 638]}, {"key": "available-to", "type": "definition", "offset": [722, 734]}, {"key": "internal-users", "type": "definition", "offset": [747, 761]}, {"key": "ip-application", "type": "definition", "offset": [882, 896]}, {"key": "system-administrator", "type": "clause", "offset": [986, 1006]}, {"key": "the-owner", "type": "definition", "offset": [1040, 1049]}, {"key": "pin-code", "type": "definition", "offset": [1134, 1142]}, {"key": "services-available", "type": "clause", "offset": [1220, 1238]}, {"key": "additional-fee", "type": "definition", "offset": [1270, 1284]}, {"key": "user-portal", "type": "clause", "offset": [1385, 1396]}, {"key": "online-resource", "type": "definition", "offset": [1415, 1430]}, {"key": "support-resources", "type": "clause", "offset": [1465, 1482]}, {"key": "to-submit", "type": "definition", "offset": [1585, 1594]}, {"key": "technical-support-team", "type": "clause", "offset": [1629, 1651]}, {"key": "trial-services", "type": "definition", "offset": [1664, 1678]}, {"key": "free-of-charge", "type": "clause", "offset": [1691, 1705]}, {"key": "service-before", "type": "clause", "offset": [1736, 1750]}, {"key": "enterprise-user-license", "type": "definition", "offset": [1762, 1785]}, {"key": "overage-fees", "type": "definition", "offset": [1842, 1854]}, {"key": "individual-user", "type": "definition", "offset": [1871, 1886]}, {"key": "extension-of", "type": "clause", "offset": [1934, 1946]}, {"key": "parent-company", "type": "definition", "offset": [2000, 2014]}, {"key": "the-strategic", "type": "clause", "offset": [2038, 2051]}, {"key": "contact-us", "type": "clause", "offset": [2210, 2220]}, {"key": "subscription-service", "type": "definition", "offset": [2273, 2293]}, {"key": "the-fixed", "type": "clause", "offset": [2329, 2338]}, {"key": "based-on", "type": "clause", "offset": [2386, 2394]}, {"key": "number-of-participants", "type": "clause", "offset": [2399, 2421]}, {"key": "to-register", "type": "clause", "offset": [2581, 2592]}, {"key": "the-customer", "type": "clause", "offset": [2634, 2646]}, {"key": "directory-services", "type": "definition", "offset": [2828, 2846]}, {"key": "monthly-subscriptions", "type": "clause", "offset": [2892, 2913]}, {"key": "activation-fee", "type": "definition", "offset": [2934, 2948]}, {"key": "service-initiation", "type": "clause", "offset": [2953, 2971]}, {"key": "annual-service", "type": "definition", "offset": [3034, 3048]}], "hash": "f35f6ed40bce41011112c37849613455", "id": 3}, {"size": 2, "samples": [{"hash": "gSiHDNVEJ5N", "uri": "/contracts/gSiHDNVEJ5N#technical-overview", "label": "Merger Agreement (GetFugu, Inc.)", "score": 19.2874736786, "published": true}, {"hash": "5x75waIn5Hf", "uri": "/contracts/5x75waIn5Hf#technical-overview", "label": "Merger Agreement (GetFugu, Inc.)", "score": 19.2874736786, "published": true}], "snippet": "Our application consists of a proprietary algorithm which operates agnostically across several mobile platforms. The algorithm is designed to function with the majority of popular embedded codes and necessarily is scalable to accommodate the mass market. The algorithm is compatible with WiFi (Wireless local area network Wireless fidelity IEEE 802.11), 3G (3rd Generation WCDMA network incorporating HSDPA- High-Speed Data Packet Access and UTMS- universal mobile telephone system). The algorithm is compatible with proprietary GSM standards essentially utilizing EDGE (Enhanced Data Rates for GSM). It represents a configuration of compiled data which interacts with wireless networks (including mobile telephony networks) and with internally hosted servers which correspond with mobile devices through multiple acccess sockets. Sockets are allocated primarily for proprietary applications. ARL (augmented reality link), VRL (voice recognition link) and GRL (geographic resource locator). A newly assigned algorithm includes a barcode scanner. The details of each facet are described below: ARL essentially utilizes Augmented reality (AR) and is a technology which provides a live direct or indirect view of a physical real-world environment whose elements are augmented by virtual computer-generated imagery. The link utilizes the mobile\u2019s digital camera to take a photograph of an object, logo or word. The results are transmitted OA (over air) and submitted to a proprietary\u2019s source database. Thereonafter, the information is balanced, moderated and processed within our vision cluster environment. Additionally, this link provides the user with an option to utilize image recognition both uplink and downlink interacting with proprietary server systems. By pointing the phone\u2019s camera at the real world and receiving augmented information directly related to the view of the camera. This might include the position of points of interest or commercial outlets. Additional sockets are allocated for Voice Recognition Link (VRL) which uses the telephone\u2019s inbuilt microphone to capture an audio file which is submitted it through to a proprietary server environment. This audio file specifically interacts between the production environment and the Nuance external voice recognition vocoding server. These same sockets are allocated for Geographic Resource Locator (GRL). This utilizes the telephone\u2019s GPS (Global Position System) capabilities to correlate the location of the user and the search target. The information is sent directly to our high-level geocoding decryption server and returned to the user as a map. The user is able to view the search target on the map and easily locate the product or services. The invention includes the provision of a barcode reader utilized to scan a standard product two-dimensional barcode in order to receive product information and pricing. The four elements above are combined into one unique application, which is designed to facilitate the consumer mobile experience. This provides a compelling arena for advertisers and retailers and through this combination the claimant monetizes a purposeful methodology of business.", "snippet_links": [{"key": "the-majority", "type": "clause", "offset": [156, 168]}, {"key": "mass-market", "type": "definition", "offset": [242, 253]}, {"key": "local-area-network", "type": "definition", "offset": [303, 321]}, {"key": "data-packet", "type": "definition", "offset": [419, 430]}, {"key": "telephone-system", "type": "definition", "offset": [465, 481]}, {"key": "enhanced-data", "type": "definition", "offset": [571, 584]}, {"key": "compiled-data", "type": "definition", "offset": [634, 647]}, {"key": "wireless-networks", "type": "definition", "offset": [669, 686]}, {"key": "hosted-servers", "type": "definition", "offset": [745, 759]}, {"key": "mobile-devices", "type": "definition", "offset": [782, 796]}, {"key": "augmented-reality", "type": "definition", "offset": [898, 915]}, {"key": "voice-recognition", "type": "definition", "offset": [928, 945]}, {"key": "details-of", "type": "clause", "offset": [1050, 1060]}, {"key": "direct-or-indirect", "type": "clause", "offset": [1183, 1201]}, {"key": "virtual-computer", "type": "definition", "offset": [1276, 1292]}, {"key": "the-link", "type": "clause", "offset": [1312, 1320]}, {"key": "the-mobile", "type": "clause", "offset": [1330, 1340]}, {"key": "digital-camera", "type": "definition", "offset": [1343, 1357]}, {"key": "an-object", "type": "definition", "offset": [1382, 1391]}, {"key": "source-database", "type": "definition", "offset": [1482, 1497]}, {"key": "the-information", "type": "clause", "offset": [1513, 1528]}, {"key": "our-vision", "type": "definition", "offset": [1573, 1583]}, {"key": "the-user", "type": "definition", "offset": [1638, 1646]}, {"key": "option-to", "type": "clause", "offset": [1655, 1664]}, {"key": "directly-related-to", "type": "definition", "offset": [1846, 1865]}, {"key": "the-position", "type": "clause", "offset": [1909, 1921]}, {"key": "points-of", "type": "clause", "offset": [1925, 1934]}, {"key": "commercial-outlets", "type": "clause", "offset": [1947, 1965]}, {"key": "server-environment", "type": "definition", "offset": [2151, 2169]}, {"key": "production-environment", "type": "definition", "offset": [2222, 2244]}, {"key": "location-of", "type": "definition", "offset": [2465, 2476]}, {"key": "the-invention", "type": "clause", "offset": [2720, 2733]}, {"key": "provision-of-a", "type": "clause", "offset": [2747, 2761]}, {"key": "standard-product", "type": "definition", "offset": [2796, 2812]}, {"key": "to-receive", "type": "definition", "offset": [2846, 2856]}, {"key": "product-information", "type": "definition", "offset": [2857, 2876]}, {"key": "and-pricing", "type": "clause", "offset": [2877, 2888]}, {"key": "the-consumer", "type": "definition", "offset": [2988, 3000]}, {"key": "the-claimant", "type": "clause", "offset": [3112, 3124]}], "hash": "a766c24d95189f979a94f5bbcc6663cb", "id": 4}, {"size": 2, "samples": [{"hash": "7CrigVXo28k", "uri": "/contracts/7CrigVXo28k#technical-overview", "label": "Byzantine Agreement Protocol", "score": 33.5315322876, "published": true}, {"hash": "hF1WJ8PSCQq", "uri": "/contracts/hF1WJ8PSCQq#technical-overview", "label": "Byzantine Agreement Protocol", "score": 33.4565734863, "published": true}], "snippet": "We first would like to stress the complexity of the problem by examining state-of-the-art authenticated BA protocols achieving optimal corruption resilience. Intuitively, without setup and given t < n , a quorum consisting of at least 2 3 of parties suffices to convince an honest party to adopt a value, as a counting argument shows that no quorum for a different value can exist. This is no longer the case when one demands t < n , and the overwhelming majority of protocols make use of signature based equivocation checks to assert that only one value will be adopted by honest parties during the protocol. Any attempt to increase the size of a quorum can be met with silence from corrupt parties, resulting an unhalting executions due to t < n . On the other hand, any attempt to relax equivocation checks can be met with agreement violation attacks by corrupt parties. This forces one to rethink the problem from a first principles approach.", "snippet_links": [{"key": "the-problem", "type": "clause", "offset": [48, 59]}, {"key": "no-quorum", "type": "clause", "offset": [339, 348]}, {"key": "the-case", "type": "definition", "offset": [400, 408]}, {"key": "use-of-signature", "type": "clause", "offset": [482, 498]}, {"key": "the-protocol", "type": "clause", "offset": [596, 608]}, {"key": "the-other-hand", "type": "clause", "offset": [753, 767]}, {"key": "agreement-violation", "type": "clause", "offset": [826, 845]}], "hash": "e25dbc4034a30d1a74230a3a136b4008", "id": 5}, {"size": 2, "samples": [{"hash": "1tOxeQUExU5", "uri": "/contracts/1tOxeQUExU5#technical-overview", "label": "Byzantine Agreement", "score": 29.1484375, "published": true}], "snippet": "We give an overview of the main techniques used in our protocol. Expand-and-Extract. Our starting point is the recent work by Fitzi, \u2587\u2587\u2587- \u2587\u2587\u2587\u2587\u2587 and Loss [FLL21], where the authors provide a new elegant way to design round-e\ufb00icient BA protocols, called Expand-and-Extract. The Expand-and-Extract iteration paradigm consists of three steps. The first step is an expansion step, where an input bit is expanded into a value with range \u2113, via a so-called Proxcensus protocol. This protocol guarantees that the outputs of honest parties lie within two consecutive values (see Definition 2).", "snippet_links": [{"key": "an-overview", "type": "clause", "offset": [8, 19]}, {"key": "starting-point", "type": "clause", "offset": [89, 103]}, {"key": "provide-a", "type": "definition", "offset": [180, 189]}, {"key": "three-steps", "type": "clause", "offset": [326, 337]}, {"key": "first-step", "type": "clause", "offset": [343, 353]}, {"key": "definition-2", "type": "clause", "offset": [570, 582]}], "hash": "4da06ad21ad8128172faf48f85e573bb", "id": 6}, {"size": 1, "samples": [{"hash": "ip5tqVKww8h", "uri": "/contracts/ip5tqVKww8h#technical-overview", "label": "Byzantine Agreement", "score": 28.1592311859, "published": true}], "snippet": "We first describe our core protocol, which ensures agreement (referred to as safety for the rest of the paper) and termination as required by Byzantine broadcast/agreement, but provides a weak notion of validity. Specifically, it achieves \u2013 Validity: if all honest parties start with certificates for the same value v, and no Byzantine party starts with a certificate for a contradictory value, then all honest parties commit on v. In Section 4 we will describe how to obtain these certificates to solve Byzantine broadcast or Byzantine agreement. The core protocol runs in iterations. In each iteration, a unique leader is elected. Each new leader picks up the state left by previous leaders and proposes a value in its iteration. Parties then cast votes on the leader\u2019s value v. In more detail, each iteration consists of 4 rounds. The first three rounds are conceptually similar to \u2587\u2587\u2587\u2587\u2587 and PBFT: (1) the leader learns the states of the system, (2) the leader proposes a value, and (3) parties vote on the value. If a party receives f + 1 votes for the same value and does not detect leader 6 \u2587\u2587\u2587\u2587 and \u2587\u2587\u2587 [19] did not analyze communication complexity in their paper. Based on our understanding, their unrolled protocol in the appendix can achieve O(n2) communication complexity by similarly incorporating threshold signatures and a quadratic common-coin protocol. equivocation, it commits on that value. We then add another round: (4) if a party commits, it notifies all other parties about the commit; upon receiving a notification, other parties accept the committed value and will vouch for that value to future leaders. Ideally, if the leader is honest, all honest parties commit v upon receiving f + 1 votes for v at the end of that iteration. A Byzantine leader can easily waste its iteration by not proposing. But it can also perform the following more subtle attacks: (1) send contradicting proposals to different honest parties, or (2) send a proposal to some but not all honest parties. We must ensure these Byzantine behaviors do not violate safety. The need for equivocation checks. To ensure safety in the first attack, parties engage in an all-to-all round of communication to forward the leader\u2019s proposal to each other for an equivocation check. If a party detects leader equivocation, i.e., sees two conflicting signed proposals from the leader, it does not commit even if it receives f + 1 votes.", "snippet_links": [{"key": "and-termination", "type": "clause", "offset": [111, 126]}, {"key": "as-required-by", "type": "clause", "offset": [127, 141]}, {"key": "certificates-for-the", "type": "clause", "offset": [284, 304]}, {"key": "in-section-4", "type": "clause", "offset": [432, 444]}, {"key": "byzantine-agreement", "type": "clause", "offset": [527, 546]}, {"key": "the-state", "type": "clause", "offset": [658, 667]}, {"key": "votes-on", "type": "clause", "offset": [750, 758]}, {"key": "the-leader", "type": "definition", "offset": [759, 769]}, {"key": "similar-to", "type": "definition", "offset": [874, 884]}, {"key": "the-system", "type": "definition", "offset": [937, 947]}, {"key": "the-value", "type": "clause", "offset": [1006, 1015]}, {"key": "a-party", "type": "clause", "offset": [1020, 1027]}, {"key": "communication-complexity", "type": "clause", "offset": [1131, 1155]}, {"key": "based-on", "type": "clause", "offset": [1172, 1180]}, {"key": "the-appendix", "type": "clause", "offset": [1227, 1239]}, {"key": "other-parties", "type": "definition", "offset": [1476, 1489]}, {"key": "upon-receiving", "type": "clause", "offset": [1508, 1522]}, {"key": "at-the-end-of", "type": "clause", "offset": [1724, 1737]}, {"key": "a-proposal", "type": "clause", "offset": [1955, 1965]}, {"key": "to-ensure", "type": "clause", "offset": [2100, 2109]}, {"key": "communication-to", "type": "clause", "offset": [2179, 2195]}], "hash": "163f78c4c268401fa7bc15fae0692413", "id": 7}, {"size": 1, "samples": [{"hash": "5mOWGfHupxb", "uri": "/contracts/5mOWGfHupxb#technical-overview", "label": "Quantum Byzantine Agreement", "score": 31.2837924957, "published": true}], "snippet": "We briefly explain the key ideas behind Theorem 1, especially how to quantize a classical protocol into a quantum one and how to simulate a quantum full-information adversary in the classical setting. The key idea is utilizing quantum superpositions to turn exposed randomness into hidden randomness. The classical private-channel protocol in [16] works as follows: (i) Each player i picks a random coin ci 0, 1 and a random leader value li [n3] and then multicasts (ci, li);", "snippet_links": [], "hash": "672a1e9a076f5952d2ed639694e977e2", "id": 8}, {"size": 1, "samples": [{"hash": "jjM9AUND1HL", "uri": "/contracts/jjM9AUND1HL#technical-overview", "label": "Multi Valued Validated Byzantine Agreement (Mvba) Protocol", "score": 35.4896888733, "published": true}], "snippet": "Given that the starting point for designing both Reducer and \u2587\u2587\u2587\u2587\u2587\u2587\u2587++ was HMVBA, we begin by revisiting HMVBA (\u00a72.1) as doing so will allow the best insight into the design choices behind our algorithms. Then, we outline the key mechanisms behind Reducer (\u00a72.2) and \u2587\u2587\u2587\u2587\u2587\u2587\u2587++ (\u00a72.3).", "snippet_links": [{"key": "given-that", "type": "clause", "offset": [0, 10]}, {"key": "starting-point", "type": "clause", "offset": [15, 29]}, {"key": "the-design", "type": "clause", "offset": [163, 173]}], "hash": "9a1e9f77824e5880f2c64e53e7250c7a", "id": 9}, {"size": 1, "samples": [{"hash": "2L5NID1Ke6F", "uri": "/contracts/2L5NID1Ke6F#technical-overview", "label": "Grant Agreement", "score": 24.8631076813, "published": true}], "snippet": "The Search and Transformation Framework is split into a number of constituent parts, all of which are separate and independently deployable. These are listed below: \u25cf Platform Primitives \u25cf Contribution Framework \u25cf Execution Framework \u25cf Search Framework Each part can be developed, deployed and operated independently and in isolation. They each provide value individually and collectively, so a user can pick and choose which parts to adopt in an isolated and iterative way, facilitating pragmatic business and commercial integration. Furthermore, as described in D4.1, Smart Search Framework POC, for each framework, a modular development pattern has been followed (libraries, distributions, solutions) ensuring that even subsystems and subcomponents can be distributed and reused in different ways. The diagram above displays the relationship between the frameworks and constituent parts and can be summarised as follows. The Contribution Frameworks provides a means for individual contributors to develop and share vocabularies, classifiers and transformers in a consistent and interoperable way. Vocabularies, classifiers and transformers are deployed into the execution framework, where their capabilities can be advertised for classification, transformation and implicit and explicit chaining. The outputs of the execution framework, along with available transformation options, are ingested into the search framework and made available to the end user via a search user interface, demonstrated in D4.4 Smart Search Prototype. All the aforementioned frameworks depend on a variety of subsystems for network, security, storage and compute, which are provisioned as platform primitives.", "snippet_links": [{"key": "number-of", "type": "definition", "offset": [56, 65]}, {"key": "listed-below", "type": "clause", "offset": [151, 163]}, {"key": "in-isolation", "type": "definition", "offset": [321, 333]}, {"key": "pick-and-choose", "type": "clause", "offset": [404, 419]}, {"key": "relationship-between-the", "type": "clause", "offset": [832, 856]}, {"key": "the-contribution", "type": "clause", "offset": [924, 940]}, {"key": "to-develop", "type": "definition", "offset": [997, 1007]}, {"key": "the-execution", "type": "clause", "offset": [1161, 1174]}, {"key": "available-to", "type": "definition", "offset": [1433, 1445]}, {"key": "the-end-user", "type": "clause", "offset": [1446, 1458]}, {"key": "user-interface", "type": "clause", "offset": [1472, 1486]}], "hash": "c12804fc53fdf697eedbf7a1e094950c", "id": 10}], "next_curs": "ClsSVWoVc35sYXdpbnNpZGVyY29udHJhY3RzcjcLEhZDbGF1c2VTbmlwcGV0R3JvdXBfdjU2Iht0ZWNobmljYWwtb3ZlcnZpZXcjMDAwMDAwMGEMogECZW4YACAA", "clause": {"title": "Technical Overview", "children": [["", ""], ["mpc", "MPC"], ["broadcast", "Broadcast"], ["security", "Security"], ["client-connections", "Client Connections"]], "size": 30, "parents": [["introduction", "Introduction"], ["obligations-of-licensor", "OBLIGATIONS OF LICENSOR"], ["general-provisions", "General Provisions"], ["obligations-of-maxi-security", "OBLIGATIONS OF MAXI SECURITY"]], "id": "technical-overview", "related": [["technical-evaluation", "TECHNICAL EVALUATION", "TECHNICAL EVALUATION"], ["technical-specifications", "Technical Specifications", "Technical Specifications"], ["technical-specifications-and-drawings", "Technical Specifications and Drawings", "Technical Specifications and Drawings"], ["technical", "Technical", "Technical"], ["technical-consultations", "Technical Consultations", "Technical Consultations"]], "related_snippets": [], "updated": "2025-07-17T06:09:22+00:00", "also_ask": [], "drafting_tip": null, "explanation": "The Technical Overview clause provides a summary of the technical aspects, specifications, or systems relevant to the agreement or project. It typically outlines the key technologies, processes, or methodologies involved, and may include descriptions of hardware, software, or integration points. By presenting this information upfront, the clause ensures that all parties have a shared understanding of the technical framework, reducing the risk of misunderstandings and setting clear expectations for project execution."}, "json": true, "cursor": ""}}