{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:APZNXGQJTHVHM4FP5WOOJMLIJG","short_pith_number":"pith:APZNXGQJ","schema_version":"1.0","canonical_sha256":"03f2db9a0999ea7670afed9ce4b16849be65790746f86bd4b8dd3203af4ea51d","source":{"kind":"arxiv","id":"1602.00148","version":2},"attestation_state":"computed","paper":{"title":"Towards Synthesis from Assume-Guarantee Contracts involving Infinite Theories: A Preliminary Report","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Andreas Katis, Andrew Gacek, Michael W. Whalen","submitted_at":"2016-01-30T18:13:15Z","abstract_excerpt":"In previous work, we have introduced a contract-based real- izability checking algorithm for assume-guarantee contracts involving infinite theories, such as linear integer/real arith- metic and uninterpreted functions over infinite domains. This algorithm can determine whether or not it is possible to con- struct a realization (i.e. an implementation) of an assume- guarantee contract. The algorithm is similar to k-induction model checking, but involves the use of quantifiers to deter- mine implementability. While our work on realizability is inherently useful for vir- tual integration in deter"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.00148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-01-30T18:13:15Z","cross_cats_sorted":[],"title_canon_sha256":"506720b510c619ac0f742c92eb5378615c3a657b3b9d79c1cd0b993c69feb02f","abstract_canon_sha256":"c6c8b7749034b7982384272cfd33c8db79e4922c5d60281dec2513ecfa83b12c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:53.048866Z","signature_b64":"OZtV8pBJ/oARN1Y2S+pd9LQvaRUsUTznwFA6gwkVXiYiKTJWAwp4etdRJYFsQofnv8lF8BZluoSiGmj/HzawDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03f2db9a0999ea7670afed9ce4b16849be65790746f86bd4b8dd3203af4ea51d","last_reissued_at":"2026-05-18T01:19:53.048423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:53.048423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Synthesis from Assume-Guarantee Contracts involving Infinite Theories: A Preliminary Report","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Andreas Katis, Andrew Gacek, Michael W. Whalen","submitted_at":"2016-01-30T18:13:15Z","abstract_excerpt":"In previous work, we have introduced a contract-based real- izability checking algorithm for assume-guarantee contracts involving infinite theories, such as linear integer/real arith- metic and uninterpreted functions over infinite domains. This algorithm can determine whether or not it is possible to con- struct a realization (i.e. an implementation) of an assume- guarantee contract. The algorithm is similar to k-induction model checking, but involves the use of quantifiers to deter- mine implementability. While our work on realizability is inherently useful for vir- tual integration in deter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00148","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.00148","created_at":"2026-05-18T01:19:53.048484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00148v2","created_at":"2026-05-18T01:19:53.048484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00148","created_at":"2026-05-18T01:19:53.048484+00:00"},{"alias_kind":"pith_short_12","alias_value":"APZNXGQJTHVH","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"APZNXGQJTHVHM4FP","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"APZNXGQJ","created_at":"2026-05-18T12:30:07.202191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/APZNXGQJTHVHM4FP5WOOJMLIJG","json":"https://pith.science/pith/APZNXGQJTHVHM4FP5WOOJMLIJG.json","graph_json":"https://pith.science/api/pith-number/APZNXGQJTHVHM4FP5WOOJMLIJG/graph.json","events_json":"https://pith.science/api/pith-number/APZNXGQJTHVHM4FP5WOOJMLIJG/events.json","paper":"https://pith.science/paper/APZNXGQJ"},"agent_actions":{"view_html":"https://pith.science/pith/APZNXGQJTHVHM4FP5WOOJMLIJG","download_json":"https://pith.science/pith/APZNXGQJTHVHM4FP5WOOJMLIJG.json","view_paper":"https://pith.science/paper/APZNXGQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00148&json=true","fetch_graph":"https://pith.science/api/pith-number/APZNXGQJTHVHM4FP5WOOJMLIJG/graph.json","fetch_events":"https://pith.science/api/pith-number/APZNXGQJTHVHM4FP5WOOJMLIJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APZNXGQJTHVHM4FP5WOOJMLIJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APZNXGQJTHVHM4FP5WOOJMLIJG/action/storage_attestation","attest_author":"https://pith.science/pith/APZNXGQJTHVHM4FP5WOOJMLIJG/action/author_attestation","sign_citation":"https://pith.science/pith/APZNXGQJTHVHM4FP5WOOJMLIJG/action/citation_signature","submit_replication":"https://pith.science/pith/APZNXGQJTHVHM4FP5WOOJMLIJG/action/replication_record"}},"created_at":"2026-05-18T01:19:53.048484+00:00","updated_at":"2026-05-18T01:19:53.048484+00:00"}