{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4TSKLCHWQ5KHXPRU6MNP6QED2J","short_pith_number":"pith:4TSKLCHW","canonical_record":{"source":{"id":"1611.01706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-05T22:55:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"550f5eb61b7cecb056737f7ee7ebd081a64162fe619967f4c335765e339dca6c","abstract_canon_sha256":"31cc4be8e0174f4df557b4dfc4c7a76ae8b6c647e84c0fbce2d81d08bc669b65"},"schema_version":"1.0"},"canonical_sha256":"e4e4a588f687547bbe34f31aff4083d24845decec8cb2db88115fa96f289d227","source":{"kind":"arxiv","id":"1611.01706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01706","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01706v1","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01706","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"4TSKLCHWQ5KH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4TSKLCHWQ5KHXPRU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4TSKLCHW","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4TSKLCHWQ5KHXPRU6MNP6QED2J","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-05T22:55:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"550f5eb61b7cecb056737f7ee7ebd081a64162fe619967f4c335765e339dca6c","abstract_canon_sha256":"31cc4be8e0174f4df557b4dfc4c7a76ae8b6c647e84c0fbce2d81d08bc669b65"},"schema_version":"1.0"},"canonical_sha256":"e4e4a588f687547bbe34f31aff4083d24845decec8cb2db88115fa96f289d227","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:04.655338Z","signature_b64":"1eGBtvUGO1FwQGrviuKCj9ZAUyEeT40rS1r7T8ebzUCjV2X5KUcYp12LiMfixOzRG7nCeQX+o/tF4rm87/v2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4e4a588f687547bbe34f31aff4083d24845decec8cb2db88115fa96f289d227","last_reissued_at":"2026-05-18T01:00:04.654788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:04.654788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01706","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-18T01:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X1kOCll8/5lKqj3TjCjR5u0joLRDweUY/HaIku4pXXYoBkaWGmT1JDgtASewlay71hLH9QVtW9N34CcxEGByCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:19:45.709676Z"},"content_sha256":"9a99c52d736a0d424ca71bc66f83dc112dd02616435d74626663c9a2d0403558","schema_version":"1.0","event_id":"sha256:9a99c52d736a0d424ca71bc66f83dc112dd02616435d74626663c9a2d0403558"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4TSKLCHWQ5KHXPRU6MNP6QED2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Eleni Bakali","submitted_at":"2016-11-05T22:55:45Z","abstract_excerpt":"We consider the class of counting problems,i.e. functions in $\\#$P, which are self reducible, and have easy decision version, i.e. for every input it is easy to decide if the value of the function $f(x)$ is zero. For example, $\\#$independent-sets of all sizes, is such a problem, and one of the hardest of this class, since it is equivalent to $\\#$SAT under multiplicative approximation preserving reductions.\n  Using these two powerful properties, self reducibility and easy decision, we prove that all problems/ functions $f$ in this class can be approximated in probabilistic polynomial time withi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01706","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-18T01:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ke4BF6q4K0GoS2TrpxB/6Kh5lHsTAhLyEBETG/L2D2qbNAtF+1i5MDjPojyGJSkwu92gIJQ73+nHerUxIoP7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:19:45.710132Z"},"content_sha256":"42cb02d639803636d523cb546b3c92cb4a5deb5e0b02424a4a756c97a0c59ac5","schema_version":"1.0","event_id":"sha256:42cb02d639803636d523cb546b3c92cb4a5deb5e0b02424a4a756c97a0c59ac5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J/bundle.json","state_url":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J/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-08-04T07:19:45Z","links":{"resolver":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J","bundle":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J/bundle.json","state":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4TSKLCHWQ5KHXPRU6MNP6QED2J","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":"31cc4be8e0174f4df557b4dfc4c7a76ae8b6c647e84c0fbce2d81d08bc669b65","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-05T22:55:45Z","title_canon_sha256":"550f5eb61b7cecb056737f7ee7ebd081a64162fe619967f4c335765e339dca6c"},"schema_version":"1.0","source":{"id":"1611.01706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01706","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01706v1","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01706","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"4TSKLCHWQ5KH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4TSKLCHWQ5KHXPRU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4TSKLCHW","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:42cb02d639803636d523cb546b3c92cb4a5deb5e0b02424a4a756c97a0c59ac5","target":"graph","created_at":"2026-05-18T01:00:04Z","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":"We consider the class of counting problems,i.e. functions in $\\#$P, which are self reducible, and have easy decision version, i.e. for every input it is easy to decide if the value of the function $f(x)$ is zero. For example, $\\#$independent-sets of all sizes, is such a problem, and one of the hardest of this class, since it is equivalent to $\\#$SAT under multiplicative approximation preserving reductions.\n  Using these two powerful properties, self reducibility and easy decision, we prove that all problems/ functions $f$ in this class can be approximated in probabilistic polynomial time withi","authors_text":"Eleni Bakali","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-05T22:55:45Z","title":"Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01706","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:9a99c52d736a0d424ca71bc66f83dc112dd02616435d74626663c9a2d0403558","target":"record","created_at":"2026-05-18T01:00:04Z","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":"31cc4be8e0174f4df557b4dfc4c7a76ae8b6c647e84c0fbce2d81d08bc669b65","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-05T22:55:45Z","title_canon_sha256":"550f5eb61b7cecb056737f7ee7ebd081a64162fe619967f4c335765e339dca6c"},"schema_version":"1.0","source":{"id":"1611.01706","kind":"arxiv","version":1}},"canonical_sha256":"e4e4a588f687547bbe34f31aff4083d24845decec8cb2db88115fa96f289d227","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4e4a588f687547bbe34f31aff4083d24845decec8cb2db88115fa96f289d227","first_computed_at":"2026-05-18T01:00:04.654788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:04.654788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1eGBtvUGO1FwQGrviuKCj9ZAUyEeT40rS1r7T8ebzUCjV2X5KUcYp12LiMfixOzRG7nCeQX+o/tF4rm87/v2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:04.655338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a99c52d736a0d424ca71bc66f83dc112dd02616435d74626663c9a2d0403558","sha256:42cb02d639803636d523cb546b3c92cb4a5deb5e0b02424a4a756c97a0c59ac5"],"state_sha256":"8c83ad2d350416730e6fcaf29d5d3ec4c7d8527f166bf1860b2cf193f3ab3392"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgnDQ6F8Y/ZKkC+7EhhqYNJCb4oIQAz1ozmwiMTciPlbYGYxOwK8+YKt5wqLUBo2UZfprawlo49hDOxKwpLEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T07:19:45.713803Z","bundle_sha256":"0ee2c0673a43433162217498fdda41ccb7b648b9c451710bc014246279ddccf0"}}