{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OMHU4OILIIBL7K7NIUPVHXY5YT","short_pith_number":"pith:OMHU4OIL","canonical_record":{"source":{"id":"1204.5714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-25T17:40:10Z","cross_cats_sorted":[],"title_canon_sha256":"e1e98cc25f679fb153968f6e24e3780c64c3f1609ffea49931cdf8aae0bec6ac","abstract_canon_sha256":"ced5bc872d37dfa032ec011d8011f1766de5aae7fe07fd29dda693370632fb6e"},"schema_version":"1.0"},"canonical_sha256":"730f4e390b4202bfabed451f53df1dc4c0734c12c2abd091d192f7d459917488","source":{"kind":"arxiv","id":"1204.5714","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5714","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5714v1","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5714","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"pith_short_12","alias_value":"OMHU4OILIIBL","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OMHU4OILIIBL7K7N","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OMHU4OIL","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OMHU4OILIIBL7K7NIUPVHXY5YT","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-25T17:40:10Z","cross_cats_sorted":[],"title_canon_sha256":"e1e98cc25f679fb153968f6e24e3780c64c3f1609ffea49931cdf8aae0bec6ac","abstract_canon_sha256":"ced5bc872d37dfa032ec011d8011f1766de5aae7fe07fd29dda693370632fb6e"},"schema_version":"1.0"},"canonical_sha256":"730f4e390b4202bfabed451f53df1dc4c0734c12c2abd091d192f7d459917488","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:01.550046Z","signature_b64":"U55BlEkyDdYh/30k75bcY+OUjBL8OVw/kWIgkoufjY0EdCcICDuUZBmmVJ7MHkNLkEVkZgvrfOQP14bHID3NAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"730f4e390b4202bfabed451f53df1dc4c0734c12c2abd091d192f7d459917488","last_reissued_at":"2026-05-18T03:57:01.549252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:01.549252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5714","source_version":1,"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-18T03:57:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bg4W2oKT8qECJZb39PzmdSx9O+NZrXs9PuvV2XpVUXWLz5JxXYKs9yi+C6tkZm9zTVMob/0ygdaOD+xl9yK3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:07:55.692796Z"},"content_sha256":"6e1eeccd87c4482c0d2cddf0f0ec336c62f396a33a9ac5678eb0e43534db76c2","schema_version":"1.0","event_id":"sha256:6e1eeccd87c4482c0d2cddf0f0ec336c62f396a33a9ac5678eb0e43534db76c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OMHU4OILIIBL7K7NIUPVHXY5YT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degree two approximate Boolean #CSPs with variable weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Colin McQuillan","submitted_at":"2012-04-25T17:40:10Z","abstract_excerpt":"A counting constraint satisfaction problem (#CSP) asks for the number of ways to satisfy a given list of constraints, drawn from a fixed constraint language \\Gamma. We study how hard it is to evaluate this number approximately. There is an interesting partial classification, due to Dyer, Goldberg, Jalsenius and Richerby, of Boolean constraint languages when the degree of instances is bounded by d>=3 - every variable appears in at most d constraints - under the assumption that \"pinning\" is allowed as part of the instance. We study the d=2 case under the stronger assumption that \"variable weight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5714","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"},"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-18T03:57:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0RLvnMdzhG5C5B0DGQ2gHsNdKjoTiKeBpvP6vexoz/bKWwwSlqkkJzVPniB0/aQ2kCff+GS+56qrBzY3o10UCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:07:55.693141Z"},"content_sha256":"4c40c488046487dc0d1260af0269f3f77bc41890237bdfde1c4ced1440bd9be8","schema_version":"1.0","event_id":"sha256:4c40c488046487dc0d1260af0269f3f77bc41890237bdfde1c4ced1440bd9be8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMHU4OILIIBL7K7NIUPVHXY5YT/bundle.json","state_url":"https://pith.science/pith/OMHU4OILIIBL7K7NIUPVHXY5YT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMHU4OILIIBL7K7NIUPVHXY5YT/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-25T20:07:55Z","links":{"resolver":"https://pith.science/pith/OMHU4OILIIBL7K7NIUPVHXY5YT","bundle":"https://pith.science/pith/OMHU4OILIIBL7K7NIUPVHXY5YT/bundle.json","state":"https://pith.science/pith/OMHU4OILIIBL7K7NIUPVHXY5YT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMHU4OILIIBL7K7NIUPVHXY5YT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OMHU4OILIIBL7K7NIUPVHXY5YT","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":"ced5bc872d37dfa032ec011d8011f1766de5aae7fe07fd29dda693370632fb6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-25T17:40:10Z","title_canon_sha256":"e1e98cc25f679fb153968f6e24e3780c64c3f1609ffea49931cdf8aae0bec6ac"},"schema_version":"1.0","source":{"id":"1204.5714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5714","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5714v1","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5714","created_at":"2026-05-18T03:57:01Z"},{"alias_kind":"pith_short_12","alias_value":"OMHU4OILIIBL","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OMHU4OILIIBL7K7N","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OMHU4OIL","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:4c40c488046487dc0d1260af0269f3f77bc41890237bdfde1c4ced1440bd9be8","target":"graph","created_at":"2026-05-18T03:57:01Z","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":"A counting constraint satisfaction problem (#CSP) asks for the number of ways to satisfy a given list of constraints, drawn from a fixed constraint language \\Gamma. We study how hard it is to evaluate this number approximately. There is an interesting partial classification, due to Dyer, Goldberg, Jalsenius and Richerby, of Boolean constraint languages when the degree of instances is bounded by d>=3 - every variable appears in at most d constraints - under the assumption that \"pinning\" is allowed as part of the instance. We study the d=2 case under the stronger assumption that \"variable weight","authors_text":"Colin McQuillan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-25T17:40:10Z","title":"Degree two approximate Boolean #CSPs with variable weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5714","kind":"arxiv","version":1},"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:6e1eeccd87c4482c0d2cddf0f0ec336c62f396a33a9ac5678eb0e43534db76c2","target":"record","created_at":"2026-05-18T03:57:01Z","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":"ced5bc872d37dfa032ec011d8011f1766de5aae7fe07fd29dda693370632fb6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-25T17:40:10Z","title_canon_sha256":"e1e98cc25f679fb153968f6e24e3780c64c3f1609ffea49931cdf8aae0bec6ac"},"schema_version":"1.0","source":{"id":"1204.5714","kind":"arxiv","version":1}},"canonical_sha256":"730f4e390b4202bfabed451f53df1dc4c0734c12c2abd091d192f7d459917488","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"730f4e390b4202bfabed451f53df1dc4c0734c12c2abd091d192f7d459917488","first_computed_at":"2026-05-18T03:57:01.549252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:01.549252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U55BlEkyDdYh/30k75bcY+OUjBL8OVw/kWIgkoufjY0EdCcICDuUZBmmVJ7MHkNLkEVkZgvrfOQP14bHID3NAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:01.550046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e1eeccd87c4482c0d2cddf0f0ec336c62f396a33a9ac5678eb0e43534db76c2","sha256:4c40c488046487dc0d1260af0269f3f77bc41890237bdfde1c4ced1440bd9be8"],"state_sha256":"0e4638f5874b14d7726c800e3228c14e0ebe6127bae552ecfb36c094d36dabaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eXQX9CXN8RCL1Bf8T4hGJ8fHs+UxkIVOSkqzAUKETtsjNkvPXxv4Zqfav1B1FDLcK6M82BgLgnWix2hKeXm4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:07:55.695055Z","bundle_sha256":"3990ef654bf78b5f8514731275147cf6791225e49a35a0b8b1f62e5ee3846eb1"}}