{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:47VSVEO2SIN45BPZO7MBNB75XG","short_pith_number":"pith:47VSVEO2","schema_version":"1.0","canonical_sha256":"e7eb2a91da921bce85f977d81687fdb981c309cd165404ab92abda000d9c3123","source":{"kind":"arxiv","id":"2407.17947","version":2},"attestation_state":"computed","paper":{"title":"Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Christoph Berkholz, Harry Vinall-Smeeth, Moritz Lichter","submitted_at":"2024-07-25T11:07:28Z","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"},"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":"2407.17947","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-07-25T11:07:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1a5ca05657cae0d942cdb6a2a15aed74f784b27461420ce510701f8ea9120a62","abstract_canon_sha256":"df16713817c2bdeeada39b06de2dca8f7e7bcee809bd482001b1aa8c18f69e3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:42.689185Z","signature_b64":"o4sQmulyKqn3gWi9U+/ar5MBClJntzUYoxEfo3k6qKu9vLNSWKgXblQ2F6Q52zR0UHgmLu9gOau0xNin/KXNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7eb2a91da921bce85f977d81687fdb981c309cd165404ab92abda000d9c3123","last_reissued_at":"2026-07-05T11:34:42.688561Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:42.688561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Christoph Berkholz, Harry Vinall-Smeeth, Moritz Lichter","submitted_at":"2024-07-25T11:07:28Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17947","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/2407.17947/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":"2407.17947","created_at":"2026-07-05T11:34:42.688657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.17947v2","created_at":"2026-07-05T11:34:42.688657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17947","created_at":"2026-07-05T11:34:42.688657+00:00"},{"alias_kind":"pith_short_12","alias_value":"47VSVEO2SIN4","created_at":"2026-07-05T11:34:42.688657+00:00"},{"alias_kind":"pith_short_16","alias_value":"47VSVEO2SIN45BPZ","created_at":"2026-07-05T11:34:42.688657+00:00"},{"alias_kind":"pith_short_8","alias_value":"47VSVEO2","created_at":"2026-07-05T11:34:42.688657+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14268","citing_title":"Supercritical Tradeoffs for Monotone Circuits","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/47VSVEO2SIN45BPZO7MBNB75XG","json":"https://pith.science/pith/47VSVEO2SIN45BPZO7MBNB75XG.json","graph_json":"https://pith.science/api/pith-number/47VSVEO2SIN45BPZO7MBNB75XG/graph.json","events_json":"https://pith.science/api/pith-number/47VSVEO2SIN45BPZO7MBNB75XG/events.json","paper":"https://pith.science/paper/47VSVEO2"},"agent_actions":{"view_html":"https://pith.science/pith/47VSVEO2SIN45BPZO7MBNB75XG","download_json":"https://pith.science/pith/47VSVEO2SIN45BPZO7MBNB75XG.json","view_paper":"https://pith.science/paper/47VSVEO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.17947&json=true","fetch_graph":"https://pith.science/api/pith-number/47VSVEO2SIN45BPZO7MBNB75XG/graph.json","fetch_events":"https://pith.science/api/pith-number/47VSVEO2SIN45BPZO7MBNB75XG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47VSVEO2SIN45BPZO7MBNB75XG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47VSVEO2SIN45BPZO7MBNB75XG/action/storage_attestation","attest_author":"https://pith.science/pith/47VSVEO2SIN45BPZO7MBNB75XG/action/author_attestation","sign_citation":"https://pith.science/pith/47VSVEO2SIN45BPZO7MBNB75XG/action/citation_signature","submit_replication":"https://pith.science/pith/47VSVEO2SIN45BPZO7MBNB75XG/action/replication_record"}},"created_at":"2026-07-05T11:34:42.688657+00:00","updated_at":"2026-07-05T11:34:42.688657+00:00"}