{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GUUQ6EJZMI4ZAWX2EZBBXNIYDM","short_pith_number":"pith:GUUQ6EJZ","canonical_record":{"source":{"id":"1708.05522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-18T07:06:23Z","cross_cats_sorted":[],"title_canon_sha256":"1f5c3014a021553980948200c70de42c0d4f6f922652a23142a8570ea9c01c1f","abstract_canon_sha256":"0ede4e0b9dc00c1cf4bd178e2874b1e7b4cbea4e2e5983e3ecba120bc15ac6f5"},"schema_version":"1.0"},"canonical_sha256":"35290f11396239905afa26421bb5181b2ce89107e87fcf16928e802806787dee","source":{"kind":"arxiv","id":"1708.05522","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05522","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05522v1","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05522","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"GUUQ6EJZMI4Z","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GUUQ6EJZMI4ZAWX2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GUUQ6EJZ","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GUUQ6EJZMI4ZAWX2EZBBXNIYDM","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-18T07:06:23Z","cross_cats_sorted":[],"title_canon_sha256":"1f5c3014a021553980948200c70de42c0d4f6f922652a23142a8570ea9c01c1f","abstract_canon_sha256":"0ede4e0b9dc00c1cf4bd178e2874b1e7b4cbea4e2e5983e3ecba120bc15ac6f5"},"schema_version":"1.0"},"canonical_sha256":"35290f11396239905afa26421bb5181b2ce89107e87fcf16928e802806787dee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:54.615425Z","signature_b64":"T5wUj4m5GPZqjisURrGAlRe5EaXuSY8OapIKJffNq4SxK9OLxPAAjifueh3qmYGpQc74nb9l7XLYexQ5GSnKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35290f11396239905afa26421bb5181b2ce89107e87fcf16928e802806787dee","last_reissued_at":"2026-05-18T00:17:54.614778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:54.614778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05522","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-18T00:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X1Xlw9yPxMWlCw3g2PrCZPfsKRmqzZQrDEl/x2M8PGdCOSuhHVT+kEMhnXd0Ho7rzCn5g1RuqQACevpd8yUeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:23:02.939384Z"},"content_sha256":"cfbe2ae23c473084b760892ea916a06385014dcf24254a24abef1813d35b6882","schema_version":"1.0","event_id":"sha256:cfbe2ae23c473084b760892ea916a06385014dcf24254a24abef1813d35b6882"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GUUQ6EJZMI4ZAWX2EZBBXNIYDM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring Directional Path-Consistency for Solving Constraint Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Michael Sioutis, Sanjiang Li, Shufeng Kong","submitted_at":"2017-08-18T07:06:23Z","abstract_excerpt":"Among the local consistency techniques used for solving constraint networks, path-consistency (PC) has received a great deal of attention. However, enforcing PC is computationally expensive and sometimes even unnecessary. Directional path-consistency (DPC) is a weaker notion of PC that considers a given variable ordering and can thus be enforced more efficiently than PC. This paper shows that DPC (the DPC enforcing algorithm of Dechter and Pearl) decides the constraint satisfaction problem (CSP) of a constraint language if it is complete and has the variable elimination property (VEP). However"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05522","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-18T00:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/ix29tgJaNfljwb4aKJ3zEMEfqNh9WaSf3XtqfyrTt6IZzGxXwrPUtrYtYk4lIsS5xHrD/pv3jTtKBexW9mBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:23:02.939742Z"},"content_sha256":"7b0731f10acd2f13545d203acbfddef93d550643284ddbc0f18574ad109657bf","schema_version":"1.0","event_id":"sha256:7b0731f10acd2f13545d203acbfddef93d550643284ddbc0f18574ad109657bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUUQ6EJZMI4ZAWX2EZBBXNIYDM/bundle.json","state_url":"https://pith.science/pith/GUUQ6EJZMI4ZAWX2EZBBXNIYDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUUQ6EJZMI4ZAWX2EZBBXNIYDM/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-06-03T01:23:02Z","links":{"resolver":"https://pith.science/pith/GUUQ6EJZMI4ZAWX2EZBBXNIYDM","bundle":"https://pith.science/pith/GUUQ6EJZMI4ZAWX2EZBBXNIYDM/bundle.json","state":"https://pith.science/pith/GUUQ6EJZMI4ZAWX2EZBBXNIYDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUUQ6EJZMI4ZAWX2EZBBXNIYDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GUUQ6EJZMI4ZAWX2EZBBXNIYDM","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":"0ede4e0b9dc00c1cf4bd178e2874b1e7b4cbea4e2e5983e3ecba120bc15ac6f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-18T07:06:23Z","title_canon_sha256":"1f5c3014a021553980948200c70de42c0d4f6f922652a23142a8570ea9c01c1f"},"schema_version":"1.0","source":{"id":"1708.05522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05522","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05522v1","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05522","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"GUUQ6EJZMI4Z","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GUUQ6EJZMI4ZAWX2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GUUQ6EJZ","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:7b0731f10acd2f13545d203acbfddef93d550643284ddbc0f18574ad109657bf","target":"graph","created_at":"2026-05-18T00:17:54Z","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":"Among the local consistency techniques used for solving constraint networks, path-consistency (PC) has received a great deal of attention. However, enforcing PC is computationally expensive and sometimes even unnecessary. Directional path-consistency (DPC) is a weaker notion of PC that considers a given variable ordering and can thus be enforced more efficiently than PC. This paper shows that DPC (the DPC enforcing algorithm of Dechter and Pearl) decides the constraint satisfaction problem (CSP) of a constraint language if it is complete and has the variable elimination property (VEP). However","authors_text":"Michael Sioutis, Sanjiang Li, Shufeng Kong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-18T07:06:23Z","title":"Exploring Directional Path-Consistency for Solving Constraint Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05522","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:cfbe2ae23c473084b760892ea916a06385014dcf24254a24abef1813d35b6882","target":"record","created_at":"2026-05-18T00:17:54Z","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":"0ede4e0b9dc00c1cf4bd178e2874b1e7b4cbea4e2e5983e3ecba120bc15ac6f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-18T07:06:23Z","title_canon_sha256":"1f5c3014a021553980948200c70de42c0d4f6f922652a23142a8570ea9c01c1f"},"schema_version":"1.0","source":{"id":"1708.05522","kind":"arxiv","version":1}},"canonical_sha256":"35290f11396239905afa26421bb5181b2ce89107e87fcf16928e802806787dee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35290f11396239905afa26421bb5181b2ce89107e87fcf16928e802806787dee","first_computed_at":"2026-05-18T00:17:54.614778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:54.614778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T5wUj4m5GPZqjisURrGAlRe5EaXuSY8OapIKJffNq4SxK9OLxPAAjifueh3qmYGpQc74nb9l7XLYexQ5GSnKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:54.615425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfbe2ae23c473084b760892ea916a06385014dcf24254a24abef1813d35b6882","sha256:7b0731f10acd2f13545d203acbfddef93d550643284ddbc0f18574ad109657bf"],"state_sha256":"72caef4a084d188e7616e69ef7cd0798bf6108910448fa9946a1dccf522645a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYPMStvTsziFUYFXRcSh8bC9bDHH5Io668H/rvAz2utqrrNSq62xi74tktA8pq0Wjtsc/S/zxfp/xOD5viIhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:23:02.941716Z","bundle_sha256":"87bcb0166a11dbd127f7b78ac48afbf856b48cce72b4a27b1648146b1277949f"}}