{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:B7OKHN6QZJ5KLRRZ4PUG25BEAU","short_pith_number":"pith:B7OKHN6Q","schema_version":"1.0","canonical_sha256":"0fdca3b7d0ca7aa5c639e3e86d74240506ab5af77cd048fbf31c4db2586e1987","source":{"kind":"arxiv","id":"1602.00458","version":1},"attestation_state":"computed","paper":{"title":"Counting Constraints in Flat Array Fragments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Elena Pagani, Francesco Alberti, Silvio Ghilardi","submitted_at":"2016-02-01T10:14:34Z","abstract_excerpt":"We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality constraints for interpreted sets, which is amenable to automated analysis. We establish decidability and complexity results for such a fragment and we implement our algorithms. The experiments run in discharging proof obligations coming from invariant checking and bounded model-checking benchmarks show the practical feasibility of our decision procedure."},"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.00458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-01T10:14:34Z","cross_cats_sorted":[],"title_canon_sha256":"ea82576e6c57cab075a4494897fc19383692bd900831e9509d4828164728bed7","abstract_canon_sha256":"4767a9ea8dea4cdef0226a10e714b07da8e6b6a6a0f39e77668a19fc064235bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:35.327063Z","signature_b64":"tsi2sIbBwwjRLHclxCaF1qGxiHELXdwoX0LM4S3gIaBPhYQVtB0TDq+LpzycL2WN18VPBWN3El5/DX/j/K8BCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fdca3b7d0ca7aa5c639e3e86d74240506ab5af77cd048fbf31c4db2586e1987","last_reissued_at":"2026-05-18T01:21:35.326425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:35.326425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Constraints in Flat Array Fragments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Elena Pagani, Francesco Alberti, Silvio Ghilardi","submitted_at":"2016-02-01T10:14:34Z","abstract_excerpt":"We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality constraints for interpreted sets, which is amenable to automated analysis. We establish decidability and complexity results for such a fragment and we implement our algorithms. The experiments run in discharging proof obligations coming from invariant checking and bounded model-checking benchmarks show the practical feasibility of our decision procedure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00458","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":"1602.00458","created_at":"2026-05-18T01:21:35.326526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00458v1","created_at":"2026-05-18T01:21:35.326526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00458","created_at":"2026-05-18T01:21:35.326526+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7OKHN6QZJ5K","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7OKHN6QZJ5KLRRZ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7OKHN6Q","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/B7OKHN6QZJ5KLRRZ4PUG25BEAU","json":"https://pith.science/pith/B7OKHN6QZJ5KLRRZ4PUG25BEAU.json","graph_json":"https://pith.science/api/pith-number/B7OKHN6QZJ5KLRRZ4PUG25BEAU/graph.json","events_json":"https://pith.science/api/pith-number/B7OKHN6QZJ5KLRRZ4PUG25BEAU/events.json","paper":"https://pith.science/paper/B7OKHN6Q"},"agent_actions":{"view_html":"https://pith.science/pith/B7OKHN6QZJ5KLRRZ4PUG25BEAU","download_json":"https://pith.science/pith/B7OKHN6QZJ5KLRRZ4PUG25BEAU.json","view_paper":"https://pith.science/paper/B7OKHN6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00458&json=true","fetch_graph":"https://pith.science/api/pith-number/B7OKHN6QZJ5KLRRZ4PUG25BEAU/graph.json","fetch_events":"https://pith.science/api/pith-number/B7OKHN6QZJ5KLRRZ4PUG25BEAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7OKHN6QZJ5KLRRZ4PUG25BEAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7OKHN6QZJ5KLRRZ4PUG25BEAU/action/storage_attestation","attest_author":"https://pith.science/pith/B7OKHN6QZJ5KLRRZ4PUG25BEAU/action/author_attestation","sign_citation":"https://pith.science/pith/B7OKHN6QZJ5KLRRZ4PUG25BEAU/action/citation_signature","submit_replication":"https://pith.science/pith/B7OKHN6QZJ5KLRRZ4PUG25BEAU/action/replication_record"}},"created_at":"2026-05-18T01:21:35.326526+00:00","updated_at":"2026-05-18T01:21:35.326526+00:00"}