{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:54NVR423KMZ6ZGZCILOCF2O6QY","short_pith_number":"pith:54NVR423","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"},"canonical_sha256":"ef1b58f35b5333ec9b2242dc22e9de862287d94e546850f6fc8f5010cf402d82","source":{"kind":"arxiv","id":"1507.02479","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02479","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02479v2","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02479","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"54NVR423KMZ6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"54NVR423KMZ6ZGZC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"54NVR423","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:54NVR423KMZ6ZGZCILOCF2O6QY","target":"record","payload":{"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"},"canonical_sha256":"ef1b58f35b5333ec9b2242dc22e9de862287d94e546850f6fc8f5010cf402d82","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"},"source_kind":"arxiv","source_id":"1507.02479","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-18T01:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RqLRzbAJ05Cr9C2OREj3gxXr3V5mxH20Wdh9KouC2CjsnWEduPIQ3VzqctgATa/oYfe1NYJLVv6BiTsrb9BaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:09:48.120546Z"},"content_sha256":"373dcc6fadaca7e4d071bb23f1238bea55635b4488ca04e5a460df585efa2226","schema_version":"1.0","event_id":"sha256:373dcc6fadaca7e4d071bb23f1238bea55635b4488ca04e5a460df585efa2226"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:54NVR423KMZ6ZGZCILOCF2O6QY","target":"graph","payload":{"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"},"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-18T01:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GFX1ayQqKLEMkRwzi8o69MjaRBG0l3DEkZieuRGLAEjys+ezYoziLcVxzgxj/qH20NxbN37NctRu6EuCrkxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:09:48.120895Z"},"content_sha256":"e51a6f2b01434a41e79798c7ec740eec0ba269d7b1f3880fabe4abe5cb022900","schema_version":"1.0","event_id":"sha256:e51a6f2b01434a41e79798c7ec740eec0ba269d7b1f3880fabe4abe5cb022900"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY/bundle.json","state_url":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54NVR423KMZ6ZGZCILOCF2O6QY/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-05-22T00:09:48Z","links":{"resolver":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY","bundle":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY/bundle.json","state":"https://pith.science/pith/54NVR423KMZ6ZGZCILOCF2O6QY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54NVR423KMZ6ZGZCILOCF2O6QY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:54NVR423KMZ6ZGZCILOCF2O6QY","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":"c3938672f3809b943f142cbf152cee20377001d3d5b1a1011e1cd82a50ea16f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T12:25:49Z","title_canon_sha256":"26706195c7bfae293d35b7d3c478fa0c188a0c3d793190df9b6c7ed4128fb7e7"},"schema_version":"1.0","source":{"id":"1507.02479","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02479","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02479v2","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02479","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"54NVR423KMZ6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"54NVR423KMZ6ZGZC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"54NVR423","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:e51a6f2b01434a41e79798c7ec740eec0ba269d7b1f3880fabe4abe5cb022900","target":"graph","created_at":"2026-05-18T01:36:37Z","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) 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","authors_text":"M. S. Ramanujan, Robert Ganian, Stefan Szeider","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T12:25:49Z","title":"Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02479","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:373dcc6fadaca7e4d071bb23f1238bea55635b4488ca04e5a460df585efa2226","target":"record","created_at":"2026-05-18T01:36:37Z","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":"c3938672f3809b943f142cbf152cee20377001d3d5b1a1011e1cd82a50ea16f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-09T12:25:49Z","title_canon_sha256":"26706195c7bfae293d35b7d3c478fa0c188a0c3d793190df9b6c7ed4128fb7e7"},"schema_version":"1.0","source":{"id":"1507.02479","kind":"arxiv","version":2}},"canonical_sha256":"ef1b58f35b5333ec9b2242dc22e9de862287d94e546850f6fc8f5010cf402d82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef1b58f35b5333ec9b2242dc22e9de862287d94e546850f6fc8f5010cf402d82","first_computed_at":"2026-05-18T01:36:37.747415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:37.747415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H8LgCS0CcHEZepKXcXmcdtoO3CwzJRluLtDibp3XwayYkxqPg93odF+lDJ87yU9aUx672qHdtNLLVm4KMdHWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:37.748031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02479","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:373dcc6fadaca7e4d071bb23f1238bea55635b4488ca04e5a460df585efa2226","sha256:e51a6f2b01434a41e79798c7ec740eec0ba269d7b1f3880fabe4abe5cb022900"],"state_sha256":"9bcbd39f74f8496d689c151fe58f1b073e97d265dd1d18626945e491e5559631"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bebJ9IQqkpup1GZk8hVUf55Ki7SN6edIX9LWrnHD7RjwJs9yzrVjfPjuuAnkMUlEpmp84wrLi5hc0KFZrkNMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T00:09:48.122991Z","bundle_sha256":"c95539701b25a1a50c235f398f715607fb2969e603d0a9a1649461ba04d61311"}}