{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XEE3JTZVUVIQHPCB7JUTQNGIKU","short_pith_number":"pith:XEE3JTZV","canonical_record":{"source":{"id":"1312.5937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-20T13:42:06Z","cross_cats_sorted":[],"title_canon_sha256":"f29accd2f5508da740ef40693a62fc4d4920b201799441d6b7ccd88296662edd","abstract_canon_sha256":"3b3b4a1405a684ee97250979c9876c7e5b661772385b27a7b4a09b8ff2261600"},"schema_version":"1.0"},"canonical_sha256":"b909b4cf35a55103bc41fa693834c85539000090b75c056ffe1dd65915d7afcc","source":{"kind":"arxiv","id":"1312.5937","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5937","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5937v2","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5937","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"XEE3JTZVUVIQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XEE3JTZVUVIQHPCB","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XEE3JTZV","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XEE3JTZVUVIQHPCB7JUTQNGIKU","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-20T13:42:06Z","cross_cats_sorted":[],"title_canon_sha256":"f29accd2f5508da740ef40693a62fc4d4920b201799441d6b7ccd88296662edd","abstract_canon_sha256":"3b3b4a1405a684ee97250979c9876c7e5b661772385b27a7b4a09b8ff2261600"},"schema_version":"1.0"},"canonical_sha256":"b909b4cf35a55103bc41fa693834c85539000090b75c056ffe1dd65915d7afcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:56.436273Z","signature_b64":"FBAQ1XGnz04/bKqUHW81X8DjVbL1IlMm/D9/8+mE/osFrIk4soOFX6k3Iv53mlbwwgEZog+AnIF5efQx8g7HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b909b4cf35a55103bc41fa693834c85539000090b75c056ffe1dd65915d7afcc","last_reissued_at":"2026-05-18T02:58:56.435585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:56.435585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5937","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQb43SV0IiWJmloWpHUVek0YaGRnrZLwKWeoh5UPqziCid7qHdX21PdtQ6HzZ2RQc1mcwgC9UlCzivD9CPTTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:15:06.285862Z"},"content_sha256":"35725ae7ec5117608943f69212866b1cacf7eca56e15bd43b381d771b2b9cb2e","schema_version":"1.0","event_id":"sha256:35725ae7ec5117608943f69212866b1cacf7eca56e15bd43b381d771b2b9cb2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XEE3JTZVUVIQHPCB7JUTQNGIKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the dynamic width of the 3-colorability problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Albert Atserias, Anuj Dawar, Oleg Verbitsky","submitted_at":"2013-12-20T13:42:06Z","abstract_excerpt":"A graph $G$ is 3-colorable if and only if it maps homomorphically to the complete 3-vertex graph $K_3$. The last condition can be checked by a $k$-consistency algorithm where the parameter $k$ has to be chosen large enough, dependent on $G$. Let $W(G)$ denote the minimum $k$ sufficient for this purpose. For a non-3-colorable graph $G$, $W(G)$ is equal to the minimum $k$ such that $G$ can be distinguished from $K_3$ in the $k$-variable existential-positive first-order logic. We define the dynamic width of the 3-colorability problem as the function $W(n)=\\max_G W(G)$, where the maximum is taken "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5937","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AK6d3bVPbn/Q6Jt7XRTbCXHk6ryGx2l5Z//Hrc68E8aeHHYJKaOt5y+NLt/rE4sttJTXiAmPhn8JnDiahn1kAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:15:06.286625Z"},"content_sha256":"349c9a346870e0b43cb12b26277170ad7ba67d6835d71e67b4772268c94605fb","schema_version":"1.0","event_id":"sha256:349c9a346870e0b43cb12b26277170ad7ba67d6835d71e67b4772268c94605fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XEE3JTZVUVIQHPCB7JUTQNGIKU/bundle.json","state_url":"https://pith.science/pith/XEE3JTZVUVIQHPCB7JUTQNGIKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XEE3JTZVUVIQHPCB7JUTQNGIKU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T01:15:06Z","links":{"resolver":"https://pith.science/pith/XEE3JTZVUVIQHPCB7JUTQNGIKU","bundle":"https://pith.science/pith/XEE3JTZVUVIQHPCB7JUTQNGIKU/bundle.json","state":"https://pith.science/pith/XEE3JTZVUVIQHPCB7JUTQNGIKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XEE3JTZVUVIQHPCB7JUTQNGIKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XEE3JTZVUVIQHPCB7JUTQNGIKU","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":"3b3b4a1405a684ee97250979c9876c7e5b661772385b27a7b4a09b8ff2261600","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-20T13:42:06Z","title_canon_sha256":"f29accd2f5508da740ef40693a62fc4d4920b201799441d6b7ccd88296662edd"},"schema_version":"1.0","source":{"id":"1312.5937","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5937","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5937v2","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5937","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"XEE3JTZVUVIQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XEE3JTZVUVIQHPCB","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XEE3JTZV","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:349c9a346870e0b43cb12b26277170ad7ba67d6835d71e67b4772268c94605fb","target":"graph","created_at":"2026-05-18T02:58: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"},"paper":{"abstract_excerpt":"A graph $G$ is 3-colorable if and only if it maps homomorphically to the complete 3-vertex graph $K_3$. The last condition can be checked by a $k$-consistency algorithm where the parameter $k$ has to be chosen large enough, dependent on $G$. Let $W(G)$ denote the minimum $k$ sufficient for this purpose. For a non-3-colorable graph $G$, $W(G)$ is equal to the minimum $k$ such that $G$ can be distinguished from $K_3$ in the $k$-variable existential-positive first-order logic. We define the dynamic width of the 3-colorability problem as the function $W(n)=\\max_G W(G)$, where the maximum is taken ","authors_text":"Albert Atserias, Anuj Dawar, Oleg Verbitsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-20T13:42:06Z","title":"On the dynamic width of the 3-colorability problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5937","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:35725ae7ec5117608943f69212866b1cacf7eca56e15bd43b381d771b2b9cb2e","target":"record","created_at":"2026-05-18T02:58: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":"3b3b4a1405a684ee97250979c9876c7e5b661772385b27a7b4a09b8ff2261600","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-20T13:42:06Z","title_canon_sha256":"f29accd2f5508da740ef40693a62fc4d4920b201799441d6b7ccd88296662edd"},"schema_version":"1.0","source":{"id":"1312.5937","kind":"arxiv","version":2}},"canonical_sha256":"b909b4cf35a55103bc41fa693834c85539000090b75c056ffe1dd65915d7afcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b909b4cf35a55103bc41fa693834c85539000090b75c056ffe1dd65915d7afcc","first_computed_at":"2026-05-18T02:58:56.435585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:56.435585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FBAQ1XGnz04/bKqUHW81X8DjVbL1IlMm/D9/8+mE/osFrIk4soOFX6k3Iv53mlbwwgEZog+AnIF5efQx8g7HDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:56.436273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5937","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35725ae7ec5117608943f69212866b1cacf7eca56e15bd43b381d771b2b9cb2e","sha256:349c9a346870e0b43cb12b26277170ad7ba67d6835d71e67b4772268c94605fb"],"state_sha256":"d5aa5c1ff3d4650d964475c77d71a27ca097a7efe232422c8562d0bd44d352e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dYQ3L03uvFV0HkOvZkjwpJtt8TY6KTLfmWCHrhzwnGCrDsWDGoXvyjna6lg4D5/a2hPbERxJScaJJZELKfryDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:15:06.290522Z","bundle_sha256":"a2df28a1e03a64e983e1307ab7e16f19c42f0e4f9f4e81cc0beba60a7d4eab12"}}