{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QRPNYWLYEGAXZ4O3BCKHDTI2RR","short_pith_number":"pith:QRPNYWLY","canonical_record":{"source":{"id":"1604.00932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-04T16:18:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6defa088851e672e9508c8759e38f08bc8282de1842e42999118be6793016da1","abstract_canon_sha256":"8388f42e96e71e6d49ecec918ec65a826f9a66011e59a223a7622c26b32cd259"},"schema_version":"1.0"},"canonical_sha256":"845edc597821817cf1db089471cd1a8c5d1b4f3319189b74259db2b69643d7aa","source":{"kind":"arxiv","id":"1604.00932","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00932","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00932v2","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00932","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"QRPNYWLYEGAX","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QRPNYWLYEGAXZ4O3","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QRPNYWLY","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QRPNYWLYEGAXZ4O3BCKHDTI2RR","target":"record","payload":{"canonical_record":{"source":{"id":"1604.00932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-04T16:18:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6defa088851e672e9508c8759e38f08bc8282de1842e42999118be6793016da1","abstract_canon_sha256":"8388f42e96e71e6d49ecec918ec65a826f9a66011e59a223a7622c26b32cd259"},"schema_version":"1.0"},"canonical_sha256":"845edc597821817cf1db089471cd1a8c5d1b4f3319189b74259db2b69643d7aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:17.583209Z","signature_b64":"nT4INyRPMP9cYCUCDKyMLl+okneXsuS7lzvfZE6qdPMVFlhfrfLWk3hbgB+wnfLY+cjji4EByH7ONm959nxNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"845edc597821817cf1db089471cd1a8c5d1b4f3319189b74259db2b69643d7aa","last_reissued_at":"2026-05-18T00:53:17.582580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:17.582580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.00932","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-18T00:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8avM7GtnN6Ru6n1EKU0Ar8mKHPce+Ie4tx/AGIGNVGd3iVAb+BVMj8KpYW+TVxIaCdUjaVwF66/liu4YJh3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:58:04.831578Z"},"content_sha256":"65138d6b05d2d6ef1ecabace3d547725c32d7547008adb205c2dd61b966c8e6a","schema_version":"1.0","event_id":"sha256:65138d6b05d2d6ef1ecabace3d547725c32d7547008adb205c2dd61b966c8e6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QRPNYWLYEGAXZ4O3BCKHDTI2RR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asking the metaquestions in constraint tractability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CC","authors_text":"Benoit Larose, Hubie Chen","submitted_at":"2016-04-04T16:18:16Z","abstract_excerpt":"The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of the CSP is as the problem of deciding, given a pair (G,H) of relational structures, whether or not there is a homomorphism from the first structure to the second structure. The CSP is in general NP-hard; a common way to restrict this problem is to fix the second structure H, so that each structure H gives rise to a problem CSP(H). The problem family CSP(H) has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00932","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-18T00:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZhCr+//zsSNnPX5Nzrmy9jcA096vJKSCKZf0Sw6W53maoWjAxJcEXz/1Szio+1ro+pJ+9ep80/KuGGyXNCcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:58:04.832351Z"},"content_sha256":"ddcf40778242f2b13de6633d10b0f162d5ea128637f1cbc450d70f3ccc722d61","schema_version":"1.0","event_id":"sha256:ddcf40778242f2b13de6633d10b0f162d5ea128637f1cbc450d70f3ccc722d61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR/bundle.json","state_url":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR/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-11T15:58:04Z","links":{"resolver":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR","bundle":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR/bundle.json","state":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QRPNYWLYEGAXZ4O3BCKHDTI2RR","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":"8388f42e96e71e6d49ecec918ec65a826f9a66011e59a223a7622c26b32cd259","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-04T16:18:16Z","title_canon_sha256":"6defa088851e672e9508c8759e38f08bc8282de1842e42999118be6793016da1"},"schema_version":"1.0","source":{"id":"1604.00932","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00932","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00932v2","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00932","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"QRPNYWLYEGAX","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QRPNYWLYEGAXZ4O3","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QRPNYWLY","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:ddcf40778242f2b13de6633d10b0f162d5ea128637f1cbc450d70f3ccc722d61","target":"graph","created_at":"2026-05-18T00:53:17Z","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":"The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of the CSP is as the problem of deciding, given a pair (G,H) of relational structures, whether or not there is a homomorphism from the first structure to the second structure. The CSP is in general NP-hard; a common way to restrict this problem is to fix the second structure H, so that each structure H gives rise to a problem CSP(H). The problem family CSP(H) has","authors_text":"Benoit Larose, Hubie Chen","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-04T16:18:16Z","title":"Asking the metaquestions in constraint tractability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00932","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:65138d6b05d2d6ef1ecabace3d547725c32d7547008adb205c2dd61b966c8e6a","target":"record","created_at":"2026-05-18T00:53:17Z","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":"8388f42e96e71e6d49ecec918ec65a826f9a66011e59a223a7622c26b32cd259","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-04T16:18:16Z","title_canon_sha256":"6defa088851e672e9508c8759e38f08bc8282de1842e42999118be6793016da1"},"schema_version":"1.0","source":{"id":"1604.00932","kind":"arxiv","version":2}},"canonical_sha256":"845edc597821817cf1db089471cd1a8c5d1b4f3319189b74259db2b69643d7aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"845edc597821817cf1db089471cd1a8c5d1b4f3319189b74259db2b69643d7aa","first_computed_at":"2026-05-18T00:53:17.582580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:17.582580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nT4INyRPMP9cYCUCDKyMLl+okneXsuS7lzvfZE6qdPMVFlhfrfLWk3hbgB+wnfLY+cjji4EByH7ONm959nxNDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:17.583209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00932","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65138d6b05d2d6ef1ecabace3d547725c32d7547008adb205c2dd61b966c8e6a","sha256:ddcf40778242f2b13de6633d10b0f162d5ea128637f1cbc450d70f3ccc722d61"],"state_sha256":"ac0afbfeaafabad4d15e94fe724a27229ee4a23051edccdeafb9d7c1d574d904"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aurqAsQLSEnZlUbCkixUnbC0goFNHO9iNSbt3SywR9H8GIqvmuqAUdIwLppV+9x6t4t6hpukueumdnK6Pv2dCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:58:04.836251Z","bundle_sha256":"771f461107b78cd3b69b7419cae5bfe87b36c5c2709dbbadf9159f9d6d92eecb"}}