{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4KZKYKCM2F7QAQAEMSUVK4J7DC","short_pith_number":"pith:4KZKYKCM","schema_version":"1.0","canonical_sha256":"e2b2ac284cd17f00400464a955713f18bae51af27f8870b0cd3881c2ac844f9e","source":{"kind":"arxiv","id":"2410.18671","version":2},"attestation_state":"computed","paper":{"title":"Axe 'Em: Eliminating Spurious States with Induction Axioms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Neta Elad, Sharon Shoham","submitted_at":"2024-10-24T12:01:57Z","abstract_excerpt":"First-order logic (FOL) has proved to be a versatile and expressive tool as the basis of abstract modeling languages. Used to verify complex systems with unbounded domains, such as heap-manipulating programs and distributed protocols, FOL, and specifically uninterpreted functions and quantifiers, strike a balance between expressiveness and amenity to automation. However, FOL semantics may differ in important ways from the intended semantics of the modeled system, due to the inability to distinguish between finite and infinite first-order structures, for example, or the undefinability of well-f"},"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":"2410.18671","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2024-10-24T12:01:57Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"c3e99930ad482b9e05c4eec45fd53d0d0170a17521830e40f522974274c3382d","abstract_canon_sha256":"b9f21c5363ca4b9cfb705f62743f7be67f1d89c385fd8c92cc576101a0166689"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:43.478321Z","signature_b64":"tI25rWAS5glmUizEIv9MTW5FkO2cwAnfuE952uDBW/DpiK2yiqc1F5Leynijz5Upy5ad25/oX44W87S+XmW1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2b2ac284cd17f00400464a955713f18bae51af27f8870b0cd3881c2ac844f9e","last_reissued_at":"2026-07-05T09:41:43.477839Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:43.477839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Axe 'Em: Eliminating Spurious States with Induction Axioms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Neta Elad, Sharon Shoham","submitted_at":"2024-10-24T12:01:57Z","abstract_excerpt":"First-order logic (FOL) has proved to be a versatile and expressive tool as the basis of abstract modeling languages. Used to verify complex systems with unbounded domains, such as heap-manipulating programs and distributed protocols, FOL, and specifically uninterpreted functions and quantifiers, strike a balance between expressiveness and amenity to automation. However, FOL semantics may differ in important ways from the intended semantics of the modeled system, due to the inability to distinguish between finite and infinite first-order structures, for example, or the undefinability of well-f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18671","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.18671/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":"2410.18671","created_at":"2026-07-05T09:41:43.477902+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.18671v2","created_at":"2026-07-05T09:41:43.477902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18671","created_at":"2026-07-05T09:41:43.477902+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KZKYKCM2F7Q","created_at":"2026-07-05T09:41:43.477902+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KZKYKCM2F7QAQAE","created_at":"2026-07-05T09:41:43.477902+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KZKYKCM","created_at":"2026-07-05T09:41:43.477902+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":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KZKYKCM2F7QAQAEMSUVK4J7DC","json":"https://pith.science/pith/4KZKYKCM2F7QAQAEMSUVK4J7DC.json","graph_json":"https://pith.science/api/pith-number/4KZKYKCM2F7QAQAEMSUVK4J7DC/graph.json","events_json":"https://pith.science/api/pith-number/4KZKYKCM2F7QAQAEMSUVK4J7DC/events.json","paper":"https://pith.science/paper/4KZKYKCM"},"agent_actions":{"view_html":"https://pith.science/pith/4KZKYKCM2F7QAQAEMSUVK4J7DC","download_json":"https://pith.science/pith/4KZKYKCM2F7QAQAEMSUVK4J7DC.json","view_paper":"https://pith.science/paper/4KZKYKCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.18671&json=true","fetch_graph":"https://pith.science/api/pith-number/4KZKYKCM2F7QAQAEMSUVK4J7DC/graph.json","fetch_events":"https://pith.science/api/pith-number/4KZKYKCM2F7QAQAEMSUVK4J7DC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KZKYKCM2F7QAQAEMSUVK4J7DC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KZKYKCM2F7QAQAEMSUVK4J7DC/action/storage_attestation","attest_author":"https://pith.science/pith/4KZKYKCM2F7QAQAEMSUVK4J7DC/action/author_attestation","sign_citation":"https://pith.science/pith/4KZKYKCM2F7QAQAEMSUVK4J7DC/action/citation_signature","submit_replication":"https://pith.science/pith/4KZKYKCM2F7QAQAEMSUVK4J7DC/action/replication_record"}},"created_at":"2026-07-05T09:41:43.477902+00:00","updated_at":"2026-07-05T09:41:43.477902+00:00"}