{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XFDGDHP26TS2TADPN4DMOH4TNB","short_pith_number":"pith:XFDGDHP2","schema_version":"1.0","canonical_sha256":"b946619dfaf4e5a9806f6f06c71f93684fd6cac0277e6b1f08c0212daae1cd6f","source":{"kind":"arxiv","id":"1008.5189","version":1},"attestation_state":"computed","paper":{"title":"Improving the Performance of maxRPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anastasia Paparrizou, Kostas Stergiou, Thanasis Balafoutis, Toby Walsh","submitted_at":"2010-08-30T23:50:33Z","abstract_excerpt":"Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRRC algorithms suffer from overheads and redundancies as they can repeatedly perform many constraint checks without triggering any value deletions. In this paper we propose techniques that can boost the performance of maxRPC algorithms. These include the combined use of two data structures to avoid many redundant constraint checks, and heuristics for the efficient ordering and execution of certain operations. Based on t"},"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":"1008.5189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-08-30T23:50:33Z","cross_cats_sorted":[],"title_canon_sha256":"a823a7d54ec1eb6ef8c91d612626f29d0ffd2ae8935fab60e4978be7d55f827d","abstract_canon_sha256":"b4e752c2f65ca505876f956126249a53f02c34ae53243f4ca38dd04ba0c5b7ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:36.383923Z","signature_b64":"tuXR8XuB4PhIX6NNcqLKN6XoFBiczj3yAUhtMvW31NC44yk+S2W9gafobnq9uojQErpoOwBeTHqId0Kfuw4JDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b946619dfaf4e5a9806f6f06c71f93684fd6cac0277e6b1f08c0212daae1cd6f","last_reissued_at":"2026-05-18T04:41:36.383502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:36.383502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the Performance of maxRPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anastasia Paparrizou, Kostas Stergiou, Thanasis Balafoutis, Toby Walsh","submitted_at":"2010-08-30T23:50:33Z","abstract_excerpt":"Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRRC algorithms suffer from overheads and redundancies as they can repeatedly perform many constraint checks without triggering any value deletions. In this paper we propose techniques that can boost the performance of maxRPC algorithms. These include the combined use of two data structures to avoid many redundant constraint checks, and heuristics for the efficient ordering and execution of certain operations. Based on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5189","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1008.5189","created_at":"2026-05-18T04:41:36.383566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.5189v1","created_at":"2026-05-18T04:41:36.383566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5189","created_at":"2026-05-18T04:41:36.383566+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFDGDHP26TS2","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFDGDHP26TS2TADP","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFDGDHP2","created_at":"2026-05-18T12:26:17.028572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XFDGDHP26TS2TADPN4DMOH4TNB","json":"https://pith.science/pith/XFDGDHP26TS2TADPN4DMOH4TNB.json","graph_json":"https://pith.science/api/pith-number/XFDGDHP26TS2TADPN4DMOH4TNB/graph.json","events_json":"https://pith.science/api/pith-number/XFDGDHP26TS2TADPN4DMOH4TNB/events.json","paper":"https://pith.science/paper/XFDGDHP2"},"agent_actions":{"view_html":"https://pith.science/pith/XFDGDHP26TS2TADPN4DMOH4TNB","download_json":"https://pith.science/pith/XFDGDHP26TS2TADPN4DMOH4TNB.json","view_paper":"https://pith.science/paper/XFDGDHP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.5189&json=true","fetch_graph":"https://pith.science/api/pith-number/XFDGDHP26TS2TADPN4DMOH4TNB/graph.json","fetch_events":"https://pith.science/api/pith-number/XFDGDHP26TS2TADPN4DMOH4TNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFDGDHP26TS2TADPN4DMOH4TNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFDGDHP26TS2TADPN4DMOH4TNB/action/storage_attestation","attest_author":"https://pith.science/pith/XFDGDHP26TS2TADPN4DMOH4TNB/action/author_attestation","sign_citation":"https://pith.science/pith/XFDGDHP26TS2TADPN4DMOH4TNB/action/citation_signature","submit_replication":"https://pith.science/pith/XFDGDHP26TS2TADPN4DMOH4TNB/action/replication_record"}},"created_at":"2026-05-18T04:41:36.383566+00:00","updated_at":"2026-05-18T04:41:36.383566+00:00"}