{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:54NVR423KMZ6ZGZCILOCF2O6QY","short_pith_number":"pith:54NVR423","schema_version":"1.0","canonical_sha256":"ef1b58f35b5333ec9b2242dc22e9de862287d94e546850f6fc8f5010cf402d82","source":{"kind":"arxiv","id":"1507.02479","version":2},"attestation_state":"computed","paper":{"title":"Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"M. S. Ramanujan, Robert Ganian, Stefan Szeider","submitted_at":"2015-07-09T12:25:49Z","abstract_excerpt":"The Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and practical applications. A central line of research is concerned with the identification of classes of instances for which CSP can be solved in polynomial time; such classes are often called \"islands of tractability.\" A prominent way of defining islands of tractability for CSP is to restrict the relations that may occur in the constraints to a fixed set, called a constraint language, whereas a constraint language is conservative if it contains all u"},"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":"1507.02479","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T12:25:49Z","cross_cats_sorted":[],"title_canon_sha256":"26706195c7bfae293d35b7d3c478fa0c188a0c3d793190df9b6c7ed4128fb7e7","abstract_canon_sha256":"c3938672f3809b943f142cbf152cee20377001d3d5b1a1011e1cd82a50ea16f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:37.748031Z","signature_b64":"H8LgCS0CcHEZepKXcXmcdtoO3CwzJRluLtDibp3XwayYkxqPg93odF+lDJ87yU9aUx672qHdtNLLVm4KMdHWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef1b58f35b5333ec9b2242dc22e9de862287d94e546850f6fc8f5010cf402d82","last_reissued_at":"2026-05-18T01:36:37.747415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:37.747415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"M. S. Ramanujan, Robert Ganian, Stefan Szeider","submitted_at":"2015-07-09T12:25:49Z","abstract_excerpt":"The Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and practical applications. A central line of research is concerned with the identification of classes of instances for which CSP can be solved in polynomial time; such classes are often called \"islands of tractability.\" A prominent way of defining islands of tractability for CSP is to restrict the relations that may occur in the constraints to a fixed set, called a constraint language, whereas a constraint language is conservative if it contains all u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02479","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":"1507.02479","created_at":"2026-05-18T01:36:37.747510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02479v2","created_at":"2026-05-18T01:36:37.747510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02479","created_at":"2026-05-18T01:36:37.747510+00:00"},{"alias_kind":"pith_short_12","alias_value":"54NVR423KMZ6","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"54NVR423KMZ6ZGZC","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"54NVR423","created_at":"2026-05-18T12:29:05.191682+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/54NVR423KMZ6ZGZCILOCF2O6QY","json":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY.json","graph_json":"https://pith.science/api/pith-number/54NVR423KMZ6ZGZCILOCF2O6QY/graph.json","events_json":"https://pith.science/api/pith-number/54NVR423KMZ6ZGZCILOCF2O6QY/events.json","paper":"https://pith.science/paper/54NVR423"},"agent_actions":{"view_html":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY","download_json":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY.json","view_paper":"https://pith.science/paper/54NVR423","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02479&json=true","fetch_graph":"https://pith.science/api/pith-number/54NVR423KMZ6ZGZCILOCF2O6QY/graph.json","fetch_events":"https://pith.science/api/pith-number/54NVR423KMZ6ZGZCILOCF2O6QY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY/action/storage_attestation","attest_author":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY/action/author_attestation","sign_citation":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY/action/citation_signature","submit_replication":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY/action/replication_record"}},"created_at":"2026-05-18T01:36:37.747510+00:00","updated_at":"2026-05-18T01:36:37.747510+00:00"}