{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JMJ3AMMEBYXJJY7FN4EUXBX6XZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a166b9c5a92125ca446cdada92b77391e5f5982c4c7ddea878b19506eda09f20","cross_cats_sorted":["cs.AI","cs.DM","cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-23T01:56:52Z","title_canon_sha256":"75d7eb535047e6be1c0f87f39e30ade1350f0a5811004e0ac4ba57b369dd93ac"},"schema_version":"1.0","source":{"id":"2205.10995","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.10995","created_at":"2026-05-21T21:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"2205.10995v3","created_at":"2026-05-21T21:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.10995","created_at":"2026-05-21T21:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"JMJ3AMMEBYXJ","created_at":"2026-05-21T21:03:56Z"},{"alias_kind":"pith_short_16","alias_value":"JMJ3AMMEBYXJJY7F","created_at":"2026-05-21T21:03:56Z"},{"alias_kind":"pith_short_8","alias_value":"JMJ3AMME","created_at":"2026-05-21T21:03:56Z"}],"graph_snapshots":[{"event_id":"sha256:efeb3b13813eae6dab7782f4ef1cd6ca4f6b60f807c19b213aa28562d56e7b05","target":"graph","created_at":"2026-05-21T21:03:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.10995/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mateus de Oliveira Oliveira, Sam Urmian","cross_cats":["cs.AI","cs.DM","cs.FL","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-23T01:56:52Z","title":"From Width-Based Model Checking to Width-Based Automated Theorem Proving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.10995","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:982403b019fe7e6ca27758ad19f5269c754209f533343cb6f0bc7c1c7a9ef2ea","target":"record","created_at":"2026-05-21T21:03:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a166b9c5a92125ca446cdada92b77391e5f5982c4c7ddea878b19506eda09f20","cross_cats_sorted":["cs.AI","cs.DM","cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-23T01:56:52Z","title_canon_sha256":"75d7eb535047e6be1c0f87f39e30ade1350f0a5811004e0ac4ba57b369dd93ac"},"schema_version":"1.0","source":{"id":"2205.10995","kind":"arxiv","version":3}},"canonical_sha256":"4b13b031840e2e94e3e56f094b86febe56be42caa4240ec7b933b61ee0881d7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b13b031840e2e94e3e56f094b86febe56be42caa4240ec7b933b61ee0881d7a","first_computed_at":"2026-05-21T21:03:56.504789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T21:03:56.504789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JLtqasmyUErXbfaAzo9GFAaO2hrmtqKbRxMSZlBY3wE7WJ0PJSUeVMrDce3+KIG3E9Xye9pogOfQZqhzNAZqAg==","signature_status":"signed_v1","signed_at":"2026-05-21T21:03:56.506299Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.10995","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:982403b019fe7e6ca27758ad19f5269c754209f533343cb6f0bc7c1c7a9ef2ea","sha256:efeb3b13813eae6dab7782f4ef1cd6ca4f6b60f807c19b213aa28562d56e7b05"],"state_sha256":"f25fb4c2bf5e4637485acd388d629ca929abce9840ff0006009412b85e54127b"}