{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QRPNYWLYEGAXZ4O3BCKHDTI2RR","short_pith_number":"pith:QRPNYWLY","schema_version":"1.0","canonical_sha256":"845edc597821817cf1db089471cd1a8c5d1b4f3319189b74259db2b69643d7aa","source":{"kind":"arxiv","id":"1604.00932","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.00932","created_at":"2026-05-18T00:53:17.582654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00932v2","created_at":"2026-05-18T00:53:17.582654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00932","created_at":"2026-05-18T00:53:17.582654+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRPNYWLYEGAX","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRPNYWLYEGAXZ4O3","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRPNYWLY","created_at":"2026-05-18T12:30:41.710351+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/QRPNYWLYEGAXZ4O3BCKHDTI2RR","json":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR.json","graph_json":"https://pith.science/api/pith-number/QRPNYWLYEGAXZ4O3BCKHDTI2RR/graph.json","events_json":"https://pith.science/api/pith-number/QRPNYWLYEGAXZ4O3BCKHDTI2RR/events.json","paper":"https://pith.science/paper/QRPNYWLY"},"agent_actions":{"view_html":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR","download_json":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR.json","view_paper":"https://pith.science/paper/QRPNYWLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00932&json=true","fetch_graph":"https://pith.science/api/pith-number/QRPNYWLYEGAXZ4O3BCKHDTI2RR/graph.json","fetch_events":"https://pith.science/api/pith-number/QRPNYWLYEGAXZ4O3BCKHDTI2RR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR/action/storage_attestation","attest_author":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR/action/author_attestation","sign_citation":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR/action/citation_signature","submit_replication":"https://pith.science/pith/QRPNYWLYEGAXZ4O3BCKHDTI2RR/action/replication_record"}},"created_at":"2026-05-18T00:53:17.582654+00:00","updated_at":"2026-05-18T00:53:17.582654+00:00"}