{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F42ZGJDK2ZNWOOYBKQ2Q3RVR5T","short_pith_number":"pith:F42ZGJDK","schema_version":"1.0","canonical_sha256":"2f3593246ad65b673b0154350dc6b1ecf9860591c81c7967890e8a4510597987","source":{"kind":"arxiv","id":"1408.1754","version":1},"attestation_state":"computed","paper":{"title":"A Partial-Order Approach to Array Content Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Graeme Gange, Harald Sondergaard, Jorge A. Navas, Peter J. Stuckey, Peter Schachte","submitted_at":"2014-08-08T03:11:41Z","abstract_excerpt":"We present a parametric abstract domain for array content analysis. The method maintains invariants for contiguous regions of the array, similar to the methods of Gopan, Reps and Sagiv, and of Halbwachs and Peron. However, it introduces a novel concept of an array content graph, avoiding the need for an up-front factorial partitioning step. The resulting analysis can be used with arbitrary numeric relational abstract domains; we evaluate the domain on a range of array manipulating program fragments."},"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":"1408.1754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-08-08T03:11:41Z","cross_cats_sorted":[],"title_canon_sha256":"4216f77ac66dc1b5a95acd3c207b94131060ac0a4a70487cd28d323856e37d3f","abstract_canon_sha256":"99556ec5ea111fff822dcb20213b230b475b6cc9401e77e47c75b5fcd0ac394c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:39.088602Z","signature_b64":"PqHtiwEcXUE/gHc1KSvsjHVEPNiTQwgECdUdLV8f4zHx6ikyjMfqGxTu7euDVnzEeyED9J9kvSGfbqxzFH22CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f3593246ad65b673b0154350dc6b1ecf9860591c81c7967890e8a4510597987","last_reissued_at":"2026-05-18T02:45:39.088115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:39.088115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Partial-Order Approach to Array Content Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Graeme Gange, Harald Sondergaard, Jorge A. Navas, Peter J. Stuckey, Peter Schachte","submitted_at":"2014-08-08T03:11:41Z","abstract_excerpt":"We present a parametric abstract domain for array content analysis. The method maintains invariants for contiguous regions of the array, similar to the methods of Gopan, Reps and Sagiv, and of Halbwachs and Peron. However, it introduces a novel concept of an array content graph, avoiding the need for an up-front factorial partitioning step. The resulting analysis can be used with arbitrary numeric relational abstract domains; we evaluate the domain on a range of array manipulating program fragments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1754","kind":"arxiv","version":1},"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":"1408.1754","created_at":"2026-05-18T02:45:39.088188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1754v1","created_at":"2026-05-18T02:45:39.088188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1754","created_at":"2026-05-18T02:45:39.088188+00:00"},{"alias_kind":"pith_short_12","alias_value":"F42ZGJDK2ZNW","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F42ZGJDK2ZNWOOYB","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F42ZGJDK","created_at":"2026-05-18T12:28:28.263976+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/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T","json":"https://pith.science/pith/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T.json","graph_json":"https://pith.science/api/pith-number/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T/graph.json","events_json":"https://pith.science/api/pith-number/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T/events.json","paper":"https://pith.science/paper/F42ZGJDK"},"agent_actions":{"view_html":"https://pith.science/pith/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T","download_json":"https://pith.science/pith/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T.json","view_paper":"https://pith.science/paper/F42ZGJDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1754&json=true","fetch_graph":"https://pith.science/api/pith-number/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T/graph.json","fetch_events":"https://pith.science/api/pith-number/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T/action/storage_attestation","attest_author":"https://pith.science/pith/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T/action/author_attestation","sign_citation":"https://pith.science/pith/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T/action/citation_signature","submit_replication":"https://pith.science/pith/F42ZGJDK2ZNWOOYBKQ2Q3RVR5T/action/replication_record"}},"created_at":"2026-05-18T02:45:39.088188+00:00","updated_at":"2026-05-18T02:45:39.088188+00:00"}