{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4QIU2Q4SUTGIYCFIDGKVLUXHNH","short_pith_number":"pith:4QIU2Q4S","schema_version":"1.0","canonical_sha256":"e4114d4392a4cc8c08a8199555d2e769f16d0c7deb939733eed208dc7f7cf788","source":{"kind":"arxiv","id":"1610.02952","version":2},"attestation_state":"computed","paper":{"title":"Incrementally Closing Octagons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andy King, Aziem Chawdhary, Ed Robbins","submitted_at":"2016-10-10T15:10:01Z","abstract_excerpt":"The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of constraints where each constraint takes the restricted form $\\pm x_i \\pm x_j \\leq d$. A key family of operations for the octagon domain are closure algorithms, which check satisfiability and provide a normal form for octagonal constraint systems. We present new quadratic incremental algorithms for closure, strong closure and integer closure and proofs of their corre"},"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":"1610.02952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-10-10T15:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"592f5ab4066242caabc2db1a24247b8aea1e5febdd53520791e5dbe6c3a8a940","abstract_canon_sha256":"3b5f1eca2cde2af41b1b7cf4015c0b65a4035cd54d02f5920686ad6bc9eeccf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:42.017182Z","signature_b64":"NDmqnutLFGVjvLQSKqgcp44lLuY4Y9ob2mxbi4F95VIhc6pfzfQSQBW1JEa2Yi+3GSEaXTaNa23TepccnIVcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4114d4392a4cc8c08a8199555d2e769f16d0c7deb939733eed208dc7f7cf788","last_reissued_at":"2026-05-18T00:31:42.016757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:42.016757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incrementally Closing Octagons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andy King, Aziem Chawdhary, Ed Robbins","submitted_at":"2016-10-10T15:10:01Z","abstract_excerpt":"The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of constraints where each constraint takes the restricted form $\\pm x_i \\pm x_j \\leq d$. A key family of operations for the octagon domain are closure algorithms, which check satisfiability and provide a normal form for octagonal constraint systems. We present new quadratic incremental algorithms for closure, strong closure and integer closure and proofs of their corre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02952","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":"1610.02952","created_at":"2026-05-18T00:31:42.016822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02952v2","created_at":"2026-05-18T00:31:42.016822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02952","created_at":"2026-05-18T00:31:42.016822+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QIU2Q4SUTGI","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QIU2Q4SUTGIYCFI","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QIU2Q4S","created_at":"2026-05-18T12:29:58.707656+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/4QIU2Q4SUTGIYCFIDGKVLUXHNH","json":"https://pith.science/pith/4QIU2Q4SUTGIYCFIDGKVLUXHNH.json","graph_json":"https://pith.science/api/pith-number/4QIU2Q4SUTGIYCFIDGKVLUXHNH/graph.json","events_json":"https://pith.science/api/pith-number/4QIU2Q4SUTGIYCFIDGKVLUXHNH/events.json","paper":"https://pith.science/paper/4QIU2Q4S"},"agent_actions":{"view_html":"https://pith.science/pith/4QIU2Q4SUTGIYCFIDGKVLUXHNH","download_json":"https://pith.science/pith/4QIU2Q4SUTGIYCFIDGKVLUXHNH.json","view_paper":"https://pith.science/paper/4QIU2Q4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02952&json=true","fetch_graph":"https://pith.science/api/pith-number/4QIU2Q4SUTGIYCFIDGKVLUXHNH/graph.json","fetch_events":"https://pith.science/api/pith-number/4QIU2Q4SUTGIYCFIDGKVLUXHNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QIU2Q4SUTGIYCFIDGKVLUXHNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QIU2Q4SUTGIYCFIDGKVLUXHNH/action/storage_attestation","attest_author":"https://pith.science/pith/4QIU2Q4SUTGIYCFIDGKVLUXHNH/action/author_attestation","sign_citation":"https://pith.science/pith/4QIU2Q4SUTGIYCFIDGKVLUXHNH/action/citation_signature","submit_replication":"https://pith.science/pith/4QIU2Q4SUTGIYCFIDGKVLUXHNH/action/replication_record"}},"created_at":"2026-05-18T00:31:42.016822+00:00","updated_at":"2026-05-18T00:31:42.016822+00:00"}