{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JBDR45U6UCFTRONH5RRYTFJMZT","short_pith_number":"pith:JBDR45U6","schema_version":"1.0","canonical_sha256":"48471e769ea08b38b9a7ec6389952cccd1d45ce69530b63c95f2779765ab3f63","source":{"kind":"arxiv","id":"1412.0073","version":2},"attestation_state":"computed","paper":{"title":"FPTAS for #BIS with Degree Bounds on One Side","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jingcheng Liu, Pinyan Lu","submitted_at":"2014-11-29T05:51:23Z","abstract_excerpt":"Counting the number of independent sets for a bipartite graph (#BIS) plays a crucial role in the study of approximate counting. It has been conjectured that there is no fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS) for #BIS, and it was proved that the problem for instances with a maximum degree of $6$ is already as hard as the general problem. In this paper, we obtain a surprising tractability result for a family of #BIS instances. We design a very simple deterministic fully polynomial-time approximation scheme (FPTAS) for #BIS when the maximum degree for one side is no"},"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":"1412.0073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-29T05:51:23Z","cross_cats_sorted":[],"title_canon_sha256":"938c62a54cf7b8a6f1b70447d5180c0b6fad487f592e4ba3371a6c55ef4c8622","abstract_canon_sha256":"7873a4ad1649771efb530c17d4287378c401913987b5cb9bbf58610c9b7853e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:18.673882Z","signature_b64":"Gx68KTePlpTVAKK9pk6Fiz/xEho09AIfxoFsS1Vaw0vfg1qbcZ2FQkWHdNyNcrfM0MMGaywZ+azwet1uGZKCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48471e769ea08b38b9a7ec6389952cccd1d45ce69530b63c95f2779765ab3f63","last_reissued_at":"2026-05-18T02:19:18.673301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:18.673301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FPTAS for #BIS with Degree Bounds on One Side","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jingcheng Liu, Pinyan Lu","submitted_at":"2014-11-29T05:51:23Z","abstract_excerpt":"Counting the number of independent sets for a bipartite graph (#BIS) plays a crucial role in the study of approximate counting. It has been conjectured that there is no fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS) for #BIS, and it was proved that the problem for instances with a maximum degree of $6$ is already as hard as the general problem. In this paper, we obtain a surprising tractability result for a family of #BIS instances. We design a very simple deterministic fully polynomial-time approximation scheme (FPTAS) for #BIS when the maximum degree for one side is no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0073","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.0073","created_at":"2026-05-18T02:19:18.673403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0073v2","created_at":"2026-05-18T02:19:18.673403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0073","created_at":"2026-05-18T02:19:18.673403+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBDR45U6UCFT","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBDR45U6UCFTRONH","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBDR45U6","created_at":"2026-05-18T12:28:33.132498+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/JBDR45U6UCFTRONH5RRYTFJMZT","json":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT.json","graph_json":"https://pith.science/api/pith-number/JBDR45U6UCFTRONH5RRYTFJMZT/graph.json","events_json":"https://pith.science/api/pith-number/JBDR45U6UCFTRONH5RRYTFJMZT/events.json","paper":"https://pith.science/paper/JBDR45U6"},"agent_actions":{"view_html":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT","download_json":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT.json","view_paper":"https://pith.science/paper/JBDR45U6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0073&json=true","fetch_graph":"https://pith.science/api/pith-number/JBDR45U6UCFTRONH5RRYTFJMZT/graph.json","fetch_events":"https://pith.science/api/pith-number/JBDR45U6UCFTRONH5RRYTFJMZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT/action/storage_attestation","attest_author":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT/action/author_attestation","sign_citation":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT/action/citation_signature","submit_replication":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT/action/replication_record"}},"created_at":"2026-05-18T02:19:18.673403+00:00","updated_at":"2026-05-18T02:19:18.673403+00:00"}