{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WDUOENIIFWGWZHK72LOZHAGWIR","short_pith_number":"pith:WDUOENII","canonical_record":{"source":{"id":"1303.7077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-28T09:39:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"23dc585a1da826360d46a90b350894dfd235f59bc3961e8b21bd0b6e81c3a0e2","abstract_canon_sha256":"684d7504248d66c18cc4e47d7199e4f342748ff7efd2dc5112ca3d53b3df66bd"},"schema_version":"1.0"},"canonical_sha256":"b0e8e235082d8d6c9d5fd2dd9380d6447286edec42ab19e29996e48d7c83714e","source":{"kind":"arxiv","id":"1303.7077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7077","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7077v1","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7077","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"WDUOENIIFWGW","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WDUOENIIFWGWZHK7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WDUOENII","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WDUOENIIFWGWZHK72LOZHAGWIR","target":"record","payload":{"canonical_record":{"source":{"id":"1303.7077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-28T09:39:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"23dc585a1da826360d46a90b350894dfd235f59bc3961e8b21bd0b6e81c3a0e2","abstract_canon_sha256":"684d7504248d66c18cc4e47d7199e4f342748ff7efd2dc5112ca3d53b3df66bd"},"schema_version":"1.0"},"canonical_sha256":"b0e8e235082d8d6c9d5fd2dd9380d6447286edec42ab19e29996e48d7c83714e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:38.293682Z","signature_b64":"Patz8cHDZksSjSrb5h3Sv7E3UBjZIgUyXfv+nLpRUztJEOeAavjxaSTAfh+OjZY4h8MdtGbpcHXo7gZVe1UgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0e8e235082d8d6c9d5fd2dd9380d6447286edec42ab19e29996e48d7c83714e","last_reissued_at":"2026-05-18T03:29:38.293230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:38.293230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.7077","source_version":1,"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-18T03:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EgeoSohESfNS9BhS+8oHIcPh71+28c+30Pz300BVyXHUQooYXbZkcSm28hf11MXQLi8xo+IJYTzHseRpRMO5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:54:56.102712Z"},"content_sha256":"4ef0fd7c5ae6341efe2cc09c9f5955a665a9daf151ce8914e38474c678e5ba41","schema_version":"1.0","event_id":"sha256:4ef0fd7c5ae6341efe2cc09c9f5955a665a9daf151ce8914e38474c678e5ba41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WDUOENIIFWGWZHK72LOZHAGWIR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the speed of constraint propagation and the time complexity of arc consistency testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Christoph Berkholz, Oleg Verbitsky","submitted_at":"2013-03-28T09:39:53Z","abstract_excerpt":"Establishing arc consistency on two relational structures is one of the most popular heuristics for the constraint satisfaction problem. We aim at determining the time complexity of arc consistency testing. The input structures $G$ and $H$ can be supposed to be connected colored graphs, as the general problem reduces to this particular case. We first observe the upper bound $O(e(G)v(H)+v(G)e(H))$, which implies the bound $O(e(G)e(H))$ in terms of the number of edges and the bound $O((v(G)+v(H))^3)$ in terms of the number of vertices. We then show that both bounds are tight up to a constant fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7077","kind":"arxiv","version":1},"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-18T03:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqdDxE21cg9k6mzNQxWuJx3uyN2XFeWNoRFaY/pd710CLa+IG39y+M0A6EIsu9KSur4N/ZMXqmVV29XluXS8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:54:56.103444Z"},"content_sha256":"f0d76032e94580dad1b2498086c414f7a46c7dc086307d3c05faf6397589fc45","schema_version":"1.0","event_id":"sha256:f0d76032e94580dad1b2498086c414f7a46c7dc086307d3c05faf6397589fc45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDUOENIIFWGWZHK72LOZHAGWIR/bundle.json","state_url":"https://pith.science/pith/WDUOENIIFWGWZHK72LOZHAGWIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDUOENIIFWGWZHK72LOZHAGWIR/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-26T00:54:56Z","links":{"resolver":"https://pith.science/pith/WDUOENIIFWGWZHK72LOZHAGWIR","bundle":"https://pith.science/pith/WDUOENIIFWGWZHK72LOZHAGWIR/bundle.json","state":"https://pith.science/pith/WDUOENIIFWGWZHK72LOZHAGWIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDUOENIIFWGWZHK72LOZHAGWIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WDUOENIIFWGWZHK72LOZHAGWIR","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":"684d7504248d66c18cc4e47d7199e4f342748ff7efd2dc5112ca3d53b3df66bd","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-28T09:39:53Z","title_canon_sha256":"23dc585a1da826360d46a90b350894dfd235f59bc3961e8b21bd0b6e81c3a0e2"},"schema_version":"1.0","source":{"id":"1303.7077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7077","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7077v1","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7077","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"WDUOENIIFWGW","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WDUOENIIFWGWZHK7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WDUOENII","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:f0d76032e94580dad1b2498086c414f7a46c7dc086307d3c05faf6397589fc45","target":"graph","created_at":"2026-05-18T03:29:38Z","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":"Establishing arc consistency on two relational structures is one of the most popular heuristics for the constraint satisfaction problem. We aim at determining the time complexity of arc consistency testing. The input structures $G$ and $H$ can be supposed to be connected colored graphs, as the general problem reduces to this particular case. We first observe the upper bound $O(e(G)v(H)+v(G)e(H))$, which implies the bound $O(e(G)e(H))$ in terms of the number of edges and the bound $O((v(G)+v(H))^3)$ in terms of the number of vertices. We then show that both bounds are tight up to a constant fac","authors_text":"Christoph Berkholz, Oleg Verbitsky","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-28T09:39:53Z","title":"On the speed of constraint propagation and the time complexity of arc consistency testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7077","kind":"arxiv","version":1},"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:4ef0fd7c5ae6341efe2cc09c9f5955a665a9daf151ce8914e38474c678e5ba41","target":"record","created_at":"2026-05-18T03:29:38Z","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":"684d7504248d66c18cc4e47d7199e4f342748ff7efd2dc5112ca3d53b3df66bd","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-28T09:39:53Z","title_canon_sha256":"23dc585a1da826360d46a90b350894dfd235f59bc3961e8b21bd0b6e81c3a0e2"},"schema_version":"1.0","source":{"id":"1303.7077","kind":"arxiv","version":1}},"canonical_sha256":"b0e8e235082d8d6c9d5fd2dd9380d6447286edec42ab19e29996e48d7c83714e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0e8e235082d8d6c9d5fd2dd9380d6447286edec42ab19e29996e48d7c83714e","first_computed_at":"2026-05-18T03:29:38.293230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:38.293230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Patz8cHDZksSjSrb5h3Sv7E3UBjZIgUyXfv+nLpRUztJEOeAavjxaSTAfh+OjZY4h8MdtGbpcHXo7gZVe1UgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:38.293682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.7077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ef0fd7c5ae6341efe2cc09c9f5955a665a9daf151ce8914e38474c678e5ba41","sha256:f0d76032e94580dad1b2498086c414f7a46c7dc086307d3c05faf6397589fc45"],"state_sha256":"597fe38e543fd793ba97b54ee201740e353c9e99919fa6bcb76bb56d084068af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JDvM7jKmNQRVSQiFZFTRqK+8YRAX1XdOfeJijX4rM/6mSqsi0dZZ3QzuRNx46pR66k3oYzxwipKxB/wX/rhWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:54:56.107036Z","bundle_sha256":"aa04359736a8701ca5fa4f4c89a81fb9346a5ee48a770c056cc0baba2a3b7458"}}