{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5F6Z722PXL5ACCWOC2D7HOIRQU","short_pith_number":"pith:5F6Z722P","schema_version":"1.0","canonical_sha256":"e97d9feb4fbafa010ace1687f3b9118517c73929569619212954c984e5389f6d","source":{"kind":"arxiv","id":"2411.10860","version":2},"attestation_state":"computed","paper":{"title":"Hereditary First-Order Logic: the tractable quantifier prefix classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.LO"],"primary_cat":"math.LO","authors_text":"Manuel Bodirsky, Santiago Guzm\\'an-Pro","submitted_at":"2024-11-16T18:50:15Z","abstract_excerpt":"Many computational problems can be modelled as the class of all finite structures $\\mathbb A$ that satisfy a fixed first-order sentence $\\phi$ hereditarily, i.e., we require that every (induced) substructure of $\\mathbb A$ satisfies $\\phi$. We call the corresponding computational problem the hereditary model checking problem for $\\phi$, and denote it by Her$(\\phi)$.\n  We present a complete description of the quantifier prefixes for $\\phi$ such that Her$(\\phi)$ is in P; we show that for every other quantifier prefix there exists a formula $\\phi$ with this prefix such that Her$(\\phi)$ is coNP-co"},"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":"2411.10860","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2024-11-16T18:50:15Z","cross_cats_sorted":["cs.CC","cs.DM","cs.LO"],"title_canon_sha256":"14a568879e3d8345b42808b60022b41832a78c59ee9dcba9909c3bd4b4e46bf2","abstract_canon_sha256":"77c4bbe9337cb69456e77d7ce84322254dc1c659f98a2d2ebdc5fe6db7338187"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:03.170974Z","signature_b64":"mxu4RJWAxjald0M726PSbt/l/1uJeMDWLeogjqehidH88S60Zs1EjuXbm04oF+c5d/JseYLY1AVx2O8QZHmwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e97d9feb4fbafa010ace1687f3b9118517c73929569619212954c984e5389f6d","last_reissued_at":"2026-07-05T11:31:03.170503Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:03.170503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hereditary First-Order Logic: the tractable quantifier prefix classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.LO"],"primary_cat":"math.LO","authors_text":"Manuel Bodirsky, Santiago Guzm\\'an-Pro","submitted_at":"2024-11-16T18:50:15Z","abstract_excerpt":"Many computational problems can be modelled as the class of all finite structures $\\mathbb A$ that satisfy a fixed first-order sentence $\\phi$ hereditarily, i.e., we require that every (induced) substructure of $\\mathbb A$ satisfies $\\phi$. We call the corresponding computational problem the hereditary model checking problem for $\\phi$, and denote it by Her$(\\phi)$.\n  We present a complete description of the quantifier prefixes for $\\phi$ such that Her$(\\phi)$ is in P; we show that for every other quantifier prefix there exists a formula $\\phi$ with this prefix such that Her$(\\phi)$ is coNP-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10860","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/2411.10860/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":"2411.10860","created_at":"2026-07-05T11:31:03.170565+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.10860v2","created_at":"2026-07-05T11:31:03.170565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10860","created_at":"2026-07-05T11:31:03.170565+00:00"},{"alias_kind":"pith_short_12","alias_value":"5F6Z722PXL5A","created_at":"2026-07-05T11:31:03.170565+00:00"},{"alias_kind":"pith_short_16","alias_value":"5F6Z722PXL5ACCWO","created_at":"2026-07-05T11:31:03.170565+00:00"},{"alias_kind":"pith_short_8","alias_value":"5F6Z722P","created_at":"2026-07-05T11:31:03.170565+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09324","citing_title":"The Network Satisfaction Problem for Relation Algebras with at most 4 Atoms","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5F6Z722PXL5ACCWOC2D7HOIRQU","json":"https://pith.science/pith/5F6Z722PXL5ACCWOC2D7HOIRQU.json","graph_json":"https://pith.science/api/pith-number/5F6Z722PXL5ACCWOC2D7HOIRQU/graph.json","events_json":"https://pith.science/api/pith-number/5F6Z722PXL5ACCWOC2D7HOIRQU/events.json","paper":"https://pith.science/paper/5F6Z722P"},"agent_actions":{"view_html":"https://pith.science/pith/5F6Z722PXL5ACCWOC2D7HOIRQU","download_json":"https://pith.science/pith/5F6Z722PXL5ACCWOC2D7HOIRQU.json","view_paper":"https://pith.science/paper/5F6Z722P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.10860&json=true","fetch_graph":"https://pith.science/api/pith-number/5F6Z722PXL5ACCWOC2D7HOIRQU/graph.json","fetch_events":"https://pith.science/api/pith-number/5F6Z722PXL5ACCWOC2D7HOIRQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5F6Z722PXL5ACCWOC2D7HOIRQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5F6Z722PXL5ACCWOC2D7HOIRQU/action/storage_attestation","attest_author":"https://pith.science/pith/5F6Z722PXL5ACCWOC2D7HOIRQU/action/author_attestation","sign_citation":"https://pith.science/pith/5F6Z722PXL5ACCWOC2D7HOIRQU/action/citation_signature","submit_replication":"https://pith.science/pith/5F6Z722PXL5ACCWOC2D7HOIRQU/action/replication_record"}},"created_at":"2026-07-05T11:31:03.170565+00:00","updated_at":"2026-07-05T11:31:03.170565+00:00"}