{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RCFHECI47V57VFWB6OB3ENIC2I","short_pith_number":"pith:RCFHECI4","canonical_record":{"source":{"id":"1701.06386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-23T13:46:59Z","cross_cats_sorted":[],"title_canon_sha256":"257be04df2573754ce9536758e6159ca9095418678096ea224d863f0b79e488e","abstract_canon_sha256":"8460ff01a88d7fe319f8705f1584fb1f149145f0821e15dd7e52459ab89b5bc0"},"schema_version":"1.0"},"canonical_sha256":"888a72091cfd7bfa96c1f383b23502d20df0b72dafedeba8b7df96ada5c8e622","source":{"kind":"arxiv","id":"1701.06386","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06386","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06386v2","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06386","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"RCFHECI47V57","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCFHECI47V57VFWB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCFHECI4","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RCFHECI47V57VFWB6OB3ENIC2I","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-23T13:46:59Z","cross_cats_sorted":[],"title_canon_sha256":"257be04df2573754ce9536758e6159ca9095418678096ea224d863f0b79e488e","abstract_canon_sha256":"8460ff01a88d7fe319f8705f1584fb1f149145f0821e15dd7e52459ab89b5bc0"},"schema_version":"1.0"},"canonical_sha256":"888a72091cfd7bfa96c1f383b23502d20df0b72dafedeba8b7df96ada5c8e622","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:39.116653Z","signature_b64":"Bt5UaQ2yI+jvf6MRU67mfb1Kq+WQC24wfNiR3QNXmxGC7gLU+95XzzdZ3SOYZnw+yt8IkdPPmBVWkUdzl7zoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"888a72091cfd7bfa96c1f383b23502d20df0b72dafedeba8b7df96ada5c8e622","last_reissued_at":"2026-05-17T23:56:39.116138Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:39.116138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06386","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-17T23:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpl4zn546jVAS8js2b2GH9NXYLztWWYkXpfe0iZQoBelv2Njfn40PC+RlzD9toPvXDM/BBomddFIJmeaOivmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:17:18.558192Z"},"content_sha256":"76ff08da0c8d1abe8ab111717adb25ce4ba0da89f5f42d775e201af1500bb45c","schema_version":"1.0","event_id":"sha256:76ff08da0c8d1abe8ab111717adb25ce4ba0da89f5f42d775e201af1500bb45c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RCFHECI47V57VFWB6OB3ENIC2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Structured View on Weighted Counting with Relations to Counting, Quantum Computation and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Cassio P. de Campos, Dennis Weyland, Georgios Stamoulis","submitted_at":"2017-01-23T13:46:59Z","abstract_excerpt":"Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path of polynomial-time non-deterministic Turing machines and the goal is to compute the sum of the weights of all paths (instead of just computing the number of accepting paths). Useful closure properties and plenty of applications make weighted counting problems interesting. The general definition of these problems captures even undecidable problems, but it turns out that obtaining an exponentially small additive approximation is just as hard as solving conventio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06386","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-17T23:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D2URjPO3jNrJCYo2bvIAQp69piYR2ef6Vj5UdyzdTYeNO1znnS/Sz47/WdmDcysY406Eq+kwyKbMS9GxdncoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:17:18.558634Z"},"content_sha256":"7119999f3231a2a6fdf158cdcf864d7faec73ca7af38e62e60a4b9b55099686e","schema_version":"1.0","event_id":"sha256:7119999f3231a2a6fdf158cdcf864d7faec73ca7af38e62e60a4b9b55099686e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCFHECI47V57VFWB6OB3ENIC2I/bundle.json","state_url":"https://pith.science/pith/RCFHECI47V57VFWB6OB3ENIC2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCFHECI47V57VFWB6OB3ENIC2I/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-27T21:17:18Z","links":{"resolver":"https://pith.science/pith/RCFHECI47V57VFWB6OB3ENIC2I","bundle":"https://pith.science/pith/RCFHECI47V57VFWB6OB3ENIC2I/bundle.json","state":"https://pith.science/pith/RCFHECI47V57VFWB6OB3ENIC2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCFHECI47V57VFWB6OB3ENIC2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RCFHECI47V57VFWB6OB3ENIC2I","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":"8460ff01a88d7fe319f8705f1584fb1f149145f0821e15dd7e52459ab89b5bc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-23T13:46:59Z","title_canon_sha256":"257be04df2573754ce9536758e6159ca9095418678096ea224d863f0b79e488e"},"schema_version":"1.0","source":{"id":"1701.06386","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06386","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06386v2","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06386","created_at":"2026-05-17T23:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"RCFHECI47V57","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCFHECI47V57VFWB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCFHECI4","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:7119999f3231a2a6fdf158cdcf864d7faec73ca7af38e62e60a4b9b55099686e","target":"graph","created_at":"2026-05-17T23:56:39Z","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":"Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path of polynomial-time non-deterministic Turing machines and the goal is to compute the sum of the weights of all paths (instead of just computing the number of accepting paths). Useful closure properties and plenty of applications make weighted counting problems interesting. The general definition of these problems captures even undecidable problems, but it turns out that obtaining an exponentially small additive approximation is just as hard as solving conventio","authors_text":"Cassio P. de Campos, Dennis Weyland, Georgios Stamoulis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-23T13:46:59Z","title":"A Structured View on Weighted Counting with Relations to Counting, Quantum Computation and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06386","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:76ff08da0c8d1abe8ab111717adb25ce4ba0da89f5f42d775e201af1500bb45c","target":"record","created_at":"2026-05-17T23:56:39Z","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":"8460ff01a88d7fe319f8705f1584fb1f149145f0821e15dd7e52459ab89b5bc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-23T13:46:59Z","title_canon_sha256":"257be04df2573754ce9536758e6159ca9095418678096ea224d863f0b79e488e"},"schema_version":"1.0","source":{"id":"1701.06386","kind":"arxiv","version":2}},"canonical_sha256":"888a72091cfd7bfa96c1f383b23502d20df0b72dafedeba8b7df96ada5c8e622","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"888a72091cfd7bfa96c1f383b23502d20df0b72dafedeba8b7df96ada5c8e622","first_computed_at":"2026-05-17T23:56:39.116138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:39.116138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bt5UaQ2yI+jvf6MRU67mfb1Kq+WQC24wfNiR3QNXmxGC7gLU+95XzzdZ3SOYZnw+yt8IkdPPmBVWkUdzl7zoBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:39.116653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06386","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76ff08da0c8d1abe8ab111717adb25ce4ba0da89f5f42d775e201af1500bb45c","sha256:7119999f3231a2a6fdf158cdcf864d7faec73ca7af38e62e60a4b9b55099686e"],"state_sha256":"bc4303ab2ff45e7fe82cf25f64bf06c961962f18e7e49657071228ea0e4b26b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hqFU4wCW2ce14LCwT0SfFMSe2TDhK1Q92tjAjxheFVJFF+mPiWVeUJWdgrWojTGwKJkxgmdOQmwa/701AjVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:17:18.561959Z","bundle_sha256":"4d86ade17052bb914d018ee5826ec8c4c310c6492c7ba206521ecee70e1fa6f1"}}