{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:47VSVEO2SIN45BPZO7MBNB75XG","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":"df16713817c2bdeeada39b06de2dca8f7e7bcee809bd482001b1aa8c18f69e3c","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-07-25T11:07:28Z","title_canon_sha256":"1a5ca05657cae0d942cdb6a2a15aed74f784b27461420ce510701f8ea9120a62"},"schema_version":"1.0","source":{"id":"2407.17947","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.17947","created_at":"2026-07-05T11:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"2407.17947v2","created_at":"2026-07-05T11:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17947","created_at":"2026-07-05T11:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"47VSVEO2SIN4","created_at":"2026-07-05T11:34:42Z"},{"alias_kind":"pith_short_16","alias_value":"47VSVEO2SIN45BPZ","created_at":"2026-07-05T11:34:42Z"},{"alias_kind":"pith_short_8","alias_value":"47VSVEO2","created_at":"2026-07-05T11:34:42Z"}],"graph_snapshots":[{"event_id":"sha256:a7910e192f443cabd8c0c17a8f0e8312a405ff540322c3afe84963dd1a93b43f","target":"graph","created_at":"2026-07-05T11:34:42Z","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/2407.17947/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the refutation complexity of graph isomorphism in the tree-like resolution calculus. Tor\\'an and W\\\"orz (TOCL 2023) showed that there is a resolution refutation of narrow width $k$ for two graphs if and only if they can be distinguished in ($k+1$)-variable first-order logic (FO$^{k+1}$) and hence by a count-free variant of the $k$-dimensional Weisfeiler-Leman algorithm. While DAG-like narrow width $k$ resolution refutations have size at most $n^k$, tree-like refutations may be much larger. We show that there are graphs of order n, whose isomorphism can be refuted in narrow width $k$ b","authors_text":"Christoph Berkholz, Harry Vinall-Smeeth, Moritz Lichter","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-07-25T11:07:28Z","title":"Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17947","kind":"arxiv","version":2},"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:0ee62ee800b13c67711b022099a0e8b58018e4d2047725e4413e61e842b474af","target":"record","created_at":"2026-07-05T11:34:42Z","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":"df16713817c2bdeeada39b06de2dca8f7e7bcee809bd482001b1aa8c18f69e3c","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-07-25T11:07:28Z","title_canon_sha256":"1a5ca05657cae0d942cdb6a2a15aed74f784b27461420ce510701f8ea9120a62"},"schema_version":"1.0","source":{"id":"2407.17947","kind":"arxiv","version":2}},"canonical_sha256":"e7eb2a91da921bce85f977d81687fdb981c309cd165404ab92abda000d9c3123","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7eb2a91da921bce85f977d81687fdb981c309cd165404ab92abda000d9c3123","first_computed_at":"2026-07-05T11:34:42.688561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:34:42.688561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o4sQmulyKqn3gWi9U+/ar5MBClJntzUYoxEfo3k6qKu9vLNSWKgXblQ2F6Q52zR0UHgmLu9gOau0xNin/KXNBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:34:42.689185Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.17947","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ee62ee800b13c67711b022099a0e8b58018e4d2047725e4413e61e842b474af","sha256:a7910e192f443cabd8c0c17a8f0e8312a405ff540322c3afe84963dd1a93b43f"],"state_sha256":"6b1fc07285c4bdd95b95ed71f3ec0d57b59b6909631b90b15522b56db1bd44ba"}