{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JUOHJ2BJAIDI7KICMCU56KTHT2","short_pith_number":"pith:JUOHJ2BJ","schema_version":"1.0","canonical_sha256":"4d1c74e82902068fa90260a9df2a679e855a3da6b7cad9a855c37bc53df19c2f","source":{"kind":"arxiv","id":"2408.10685","version":1},"attestation_state":"computed","paper":{"title":"Proving Cutoff Bounds for Safety Properties in First-Order Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Eden Frenkel, Raz Lotan, Sharon Shoham","submitted_at":"2024-08-20T09:37:27Z","abstract_excerpt":"First-order logic has been established as an important tool for modeling and verifying intricate systems such as distributed protocols and concurrent systems. These systems are parametric in the number of nodes in the network or the number of threads, which is finite in any system instance, but unbounded. One disadvantage of first-order logic is that it cannot distinguish between finite and infinite structures, leading to spurious counterexamples. To mitigate this, we offer a verification approach that captures only finite system instances. Our approach is an adaptation of the cutoff method to"},"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":"2408.10685","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-08-20T09:37:27Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"92f08c042d94cce239211a073d2009423f0e9055e0aaeccc9818004dd320524e","abstract_canon_sha256":"e591165bfda1cf9146a9f924f213c9476c4bc5a6d819446a4e1e6c41796ae38f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:15.846693Z","signature_b64":"RhNpkQJg/Jg+5aV+FF5iLe1oa0v7qLLCil4T3nTos+pp0PetDdbYwvVMMmHo1Dm1k+tdca/n8KyOaOXH0GyDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d1c74e82902068fa90260a9df2a679e855a3da6b7cad9a855c37bc53df19c2f","last_reissued_at":"2026-07-05T08:57:15.846197Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:15.846197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proving Cutoff Bounds for Safety Properties in First-Order Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Eden Frenkel, Raz Lotan, Sharon Shoham","submitted_at":"2024-08-20T09:37:27Z","abstract_excerpt":"First-order logic has been established as an important tool for modeling and verifying intricate systems such as distributed protocols and concurrent systems. These systems are parametric in the number of nodes in the network or the number of threads, which is finite in any system instance, but unbounded. One disadvantage of first-order logic is that it cannot distinguish between finite and infinite structures, leading to spurious counterexamples. To mitigate this, we offer a verification approach that captures only finite system instances. Our approach is an adaptation of the cutoff method to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10685","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.10685/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2408.10685","created_at":"2026-07-05T08:57:15.846261+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.10685v1","created_at":"2026-07-05T08:57:15.846261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10685","created_at":"2026-07-05T08:57:15.846261+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUOHJ2BJAIDI","created_at":"2026-07-05T08:57:15.846261+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUOHJ2BJAIDI7KIC","created_at":"2026-07-05T08:57:15.846261+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUOHJ2BJ","created_at":"2026-07-05T08:57:15.846261+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.13996","citing_title":"Implicit Rankings for Verifying Liveness Properties in First-Order Logic","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JUOHJ2BJAIDI7KICMCU56KTHT2","json":"https://pith.science/pith/JUOHJ2BJAIDI7KICMCU56KTHT2.json","graph_json":"https://pith.science/api/pith-number/JUOHJ2BJAIDI7KICMCU56KTHT2/graph.json","events_json":"https://pith.science/api/pith-number/JUOHJ2BJAIDI7KICMCU56KTHT2/events.json","paper":"https://pith.science/paper/JUOHJ2BJ"},"agent_actions":{"view_html":"https://pith.science/pith/JUOHJ2BJAIDI7KICMCU56KTHT2","download_json":"https://pith.science/pith/JUOHJ2BJAIDI7KICMCU56KTHT2.json","view_paper":"https://pith.science/paper/JUOHJ2BJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.10685&json=true","fetch_graph":"https://pith.science/api/pith-number/JUOHJ2BJAIDI7KICMCU56KTHT2/graph.json","fetch_events":"https://pith.science/api/pith-number/JUOHJ2BJAIDI7KICMCU56KTHT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUOHJ2BJAIDI7KICMCU56KTHT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUOHJ2BJAIDI7KICMCU56KTHT2/action/storage_attestation","attest_author":"https://pith.science/pith/JUOHJ2BJAIDI7KICMCU56KTHT2/action/author_attestation","sign_citation":"https://pith.science/pith/JUOHJ2BJAIDI7KICMCU56KTHT2/action/citation_signature","submit_replication":"https://pith.science/pith/JUOHJ2BJAIDI7KICMCU56KTHT2/action/replication_record"}},"created_at":"2026-07-05T08:57:15.846261+00:00","updated_at":"2026-07-05T08:57:15.846261+00:00"}