{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4TSKLCHWQ5KHXPRU6MNP6QED2J","short_pith_number":"pith:4TSKLCHW","schema_version":"1.0","canonical_sha256":"e4e4a588f687547bbe34f31aff4083d24845decec8cb2db88115fa96f289d227","source":{"kind":"arxiv","id":"1611.01706","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.01706","created_at":"2026-05-18T01:00:04.654870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01706v1","created_at":"2026-05-18T01:00:04.654870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01706","created_at":"2026-05-18T01:00:04.654870+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TSKLCHWQ5KH","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TSKLCHWQ5KHXPRU","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TSKLCHW","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06393","citing_title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J","json":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J.json","graph_json":"https://pith.science/api/pith-number/4TSKLCHWQ5KHXPRU6MNP6QED2J/graph.json","events_json":"https://pith.science/api/pith-number/4TSKLCHWQ5KHXPRU6MNP6QED2J/events.json","paper":"https://pith.science/paper/4TSKLCHW"},"agent_actions":{"view_html":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J","download_json":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J.json","view_paper":"https://pith.science/paper/4TSKLCHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01706&json=true","fetch_graph":"https://pith.science/api/pith-number/4TSKLCHWQ5KHXPRU6MNP6QED2J/graph.json","fetch_events":"https://pith.science/api/pith-number/4TSKLCHWQ5KHXPRU6MNP6QED2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J/action/storage_attestation","attest_author":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J/action/author_attestation","sign_citation":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J/action/citation_signature","submit_replication":"https://pith.science/pith/4TSKLCHWQ5KHXPRU6MNP6QED2J/action/replication_record"}},"created_at":"2026-05-18T01:00:04.654870+00:00","updated_at":"2026-05-18T01:00:04.654870+00:00"}