{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JMJ3AMMEBYXJJY7FN4EUXBX6XZ","short_pith_number":"pith:JMJ3AMME","schema_version":"1.0","canonical_sha256":"4b13b031840e2e94e3e56f094b86febe56be42caa4240ec7b933b61ee0881d7a","source":{"kind":"arxiv","id":"2205.10995","version":3},"attestation_state":"computed","paper":{"title":"From Width-Based Model Checking to Width-Based Automated Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM","cs.FL","cs.LO"],"primary_cat":"cs.DS","authors_text":"Mateus de Oliveira Oliveira, Sam Urmian","submitted_at":"2022-05-23T01:56:52Z","abstract_excerpt":"In the field of parameterized complexity theory, the study of graph width measures has been intimately connected with the development of width-based model checking algorithms for combinatorial properties on graphs. In this work, we introduce a general framework to convert a large class of width-based model-checking algorithms into algorithms that can be used to test the validity of graph-theoretic conjectures on classes of graphs of bounded width. Our framework is modular and can be applied with respect to several well-studied width measures for graphs, including treewidth and cliquewidth.\n  A"},"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":"2205.10995","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-23T01:56:52Z","cross_cats_sorted":["cs.AI","cs.DM","cs.FL","cs.LO"],"title_canon_sha256":"75d7eb535047e6be1c0f87f39e30ade1350f0a5811004e0ac4ba57b369dd93ac","abstract_canon_sha256":"a166b9c5a92125ca446cdada92b77391e5f5982c4c7ddea878b19506eda09f20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T21:03:56.506299Z","signature_b64":"JLtqasmyUErXbfaAzo9GFAaO2hrmtqKbRxMSZlBY3wE7WJ0PJSUeVMrDce3+KIG3E9Xye9pogOfQZqhzNAZqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b13b031840e2e94e3e56f094b86febe56be42caa4240ec7b933b61ee0881d7a","last_reissued_at":"2026-05-21T21:03:56.504789Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T21:03:56.504789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Width-Based Model Checking to Width-Based Automated Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM","cs.FL","cs.LO"],"primary_cat":"cs.DS","authors_text":"Mateus de Oliveira Oliveira, Sam Urmian","submitted_at":"2022-05-23T01:56:52Z","abstract_excerpt":"In the field of parameterized complexity theory, the study of graph width measures has been intimately connected with the development of width-based model checking algorithms for combinatorial properties on graphs. In this work, we introduce a general framework to convert a large class of width-based model-checking algorithms into algorithms that can be used to test the validity of graph-theoretic conjectures on classes of graphs of bounded width. Our framework is modular and can be applied with respect to several well-studied width measures for graphs, including treewidth and cliquewidth.\n  A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.10995","kind":"arxiv","version":3},"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/2205.10995/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":"2205.10995","created_at":"2026-05-21T21:03:56.504867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.10995v3","created_at":"2026-05-21T21:03:56.504867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.10995","created_at":"2026-05-21T21:03:56.504867+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMJ3AMMEBYXJ","created_at":"2026-05-21T21:03:56.504867+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMJ3AMMEBYXJJY7F","created_at":"2026-05-21T21:03:56.504867+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMJ3AMME","created_at":"2026-05-21T21:03:56.504867+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/JMJ3AMMEBYXJJY7FN4EUXBX6XZ","json":"https://pith.science/pith/JMJ3AMMEBYXJJY7FN4EUXBX6XZ.json","graph_json":"https://pith.science/api/pith-number/JMJ3AMMEBYXJJY7FN4EUXBX6XZ/graph.json","events_json":"https://pith.science/api/pith-number/JMJ3AMMEBYXJJY7FN4EUXBX6XZ/events.json","paper":"https://pith.science/paper/JMJ3AMME"},"agent_actions":{"view_html":"https://pith.science/pith/JMJ3AMMEBYXJJY7FN4EUXBX6XZ","download_json":"https://pith.science/pith/JMJ3AMMEBYXJJY7FN4EUXBX6XZ.json","view_paper":"https://pith.science/paper/JMJ3AMME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.10995&json=true","fetch_graph":"https://pith.science/api/pith-number/JMJ3AMMEBYXJJY7FN4EUXBX6XZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JMJ3AMMEBYXJJY7FN4EUXBX6XZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMJ3AMMEBYXJJY7FN4EUXBX6XZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMJ3AMMEBYXJJY7FN4EUXBX6XZ/action/storage_attestation","attest_author":"https://pith.science/pith/JMJ3AMMEBYXJJY7FN4EUXBX6XZ/action/author_attestation","sign_citation":"https://pith.science/pith/JMJ3AMMEBYXJJY7FN4EUXBX6XZ/action/citation_signature","submit_replication":"https://pith.science/pith/JMJ3AMMEBYXJJY7FN4EUXBX6XZ/action/replication_record"}},"created_at":"2026-05-21T21:03:56.504867+00:00","updated_at":"2026-05-21T21:03:56.504867+00:00"}