{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G5J3RFVTETW4RNBFV7JXFIAU4Y","short_pith_number":"pith:G5J3RFVT","schema_version":"1.0","canonical_sha256":"3753b896b324edc8b425afd372a014e632285cdbcac9757ccaeafc7befc83f44","source":{"kind":"arxiv","id":"1402.4370","version":1},"attestation_state":"computed","paper":{"title":"FPTAS for Weighted Fibonacci Gates and Its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chihao Zhang, Menghui Wang, Pinyan Lu","submitted_at":"2014-02-18T15:15:37Z","abstract_excerpt":"Fibonacci gate problems have severed as computation primitives to solve other problems by holographic algorithm and play an important role in the dichotomy of exact counting for Holant and CSP frameworks. We generalize them to weighted cases and allow each vertex function to have different parameters, which is a much boarder family and #P-hard for exactly counting. We design a fully polynomial-time approximation scheme (FPTAS) for this generalization by correlation decay technique. This is the first deterministic FPTAS for approximate counting in the general Holant framework without a degree b"},"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":"1402.4370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-18T15:15:37Z","cross_cats_sorted":[],"title_canon_sha256":"bc954cc53e8312f5436442bdc63fbf3939e208fd2ca3c0fe6ee356cbc6d2a2f2","abstract_canon_sha256":"ddd2d8f833fecd2c28d3a20e8eab7c25055980da60b971a297054476b0f5dd1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:44.066941Z","signature_b64":"Ki82uJ64iLG1yPwjp22WP9/99g7xzkdksiwzU/es3j2DUFQ5nKD7hqb4VPuGomi5GBKX4zHmHDuPNT6TWMQdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3753b896b324edc8b425afd372a014e632285cdbcac9757ccaeafc7befc83f44","last_reissued_at":"2026-05-18T02:58:44.066235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:44.066235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FPTAS for Weighted Fibonacci Gates and Its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chihao Zhang, Menghui Wang, Pinyan Lu","submitted_at":"2014-02-18T15:15:37Z","abstract_excerpt":"Fibonacci gate problems have severed as computation primitives to solve other problems by holographic algorithm and play an important role in the dichotomy of exact counting for Holant and CSP frameworks. We generalize them to weighted cases and allow each vertex function to have different parameters, which is a much boarder family and #P-hard for exactly counting. We design a fully polynomial-time approximation scheme (FPTAS) for this generalization by correlation decay technique. This is the first deterministic FPTAS for approximate counting in the general Holant framework without a degree b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4370","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":"1402.4370","created_at":"2026-05-18T02:58:44.066356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4370v1","created_at":"2026-05-18T02:58:44.066356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4370","created_at":"2026-05-18T02:58:44.066356+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5J3RFVTETW4","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5J3RFVTETW4RNBF","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5J3RFVT","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G5J3RFVTETW4RNBFV7JXFIAU4Y","json":"https://pith.science/pith/G5J3RFVTETW4RNBFV7JXFIAU4Y.json","graph_json":"https://pith.science/api/pith-number/G5J3RFVTETW4RNBFV7JXFIAU4Y/graph.json","events_json":"https://pith.science/api/pith-number/G5J3RFVTETW4RNBFV7JXFIAU4Y/events.json","paper":"https://pith.science/paper/G5J3RFVT"},"agent_actions":{"view_html":"https://pith.science/pith/G5J3RFVTETW4RNBFV7JXFIAU4Y","download_json":"https://pith.science/pith/G5J3RFVTETW4RNBFV7JXFIAU4Y.json","view_paper":"https://pith.science/paper/G5J3RFVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4370&json=true","fetch_graph":"https://pith.science/api/pith-number/G5J3RFVTETW4RNBFV7JXFIAU4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/G5J3RFVTETW4RNBFV7JXFIAU4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5J3RFVTETW4RNBFV7JXFIAU4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5J3RFVTETW4RNBFV7JXFIAU4Y/action/storage_attestation","attest_author":"https://pith.science/pith/G5J3RFVTETW4RNBFV7JXFIAU4Y/action/author_attestation","sign_citation":"https://pith.science/pith/G5J3RFVTETW4RNBFV7JXFIAU4Y/action/citation_signature","submit_replication":"https://pith.science/pith/G5J3RFVTETW4RNBFV7JXFIAU4Y/action/replication_record"}},"created_at":"2026-05-18T02:58:44.066356+00:00","updated_at":"2026-05-18T02:58:44.066356+00:00"}