{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JBDR45U6UCFTRONH5RRYTFJMZT","short_pith_number":"pith:JBDR45U6","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"},"canonical_sha256":"48471e769ea08b38b9a7ec6389952cccd1d45ce69530b63c95f2779765ab3f63","source":{"kind":"arxiv","id":"1412.0073","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0073","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0073v2","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0073","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"JBDR45U6UCFT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JBDR45U6UCFTRONH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JBDR45U6","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JBDR45U6UCFTRONH5RRYTFJMZT","target":"record","payload":{"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"},"canonical_sha256":"48471e769ea08b38b9a7ec6389952cccd1d45ce69530b63c95f2779765ab3f63","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"},"source_kind":"arxiv","source_id":"1412.0073","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-18T02:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R/SvmJe7jLLxu6oXCq1MghzZMWWmHle1SuYI+cKkbMSBOWJmbDe4nz0yfLiJw9Gh+DAxB9FOIUmkuhLPF+g+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:22:53.860894Z"},"content_sha256":"c8c3676b3b4531d2ed282ca81ff42eef87465e46504c799c9372a909bc1ad16b","schema_version":"1.0","event_id":"sha256:c8c3676b3b4531d2ed282ca81ff42eef87465e46504c799c9372a909bc1ad16b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JBDR45U6UCFTRONH5RRYTFJMZT","target":"graph","payload":{"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"},"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-18T02:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hilK5V4QQVsiCFQZLlfZ8emT+qjbEs3cpP4YXroWLuo0yAx0Pzh3sPgls6qMGjpqukqyFah1PDNpVkuAVmH/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:22:53.861236Z"},"content_sha256":"afde823377f7555bf4b86f8217bcbcae2de0aad5b5ec11501a43a557fd272754","schema_version":"1.0","event_id":"sha256:afde823377f7555bf4b86f8217bcbcae2de0aad5b5ec11501a43a557fd272754"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT/bundle.json","state_url":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBDR45U6UCFTRONH5RRYTFJMZT/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-28T15:22:53Z","links":{"resolver":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT","bundle":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT/bundle.json","state":"https://pith.science/pith/JBDR45U6UCFTRONH5RRYTFJMZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBDR45U6UCFTRONH5RRYTFJMZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JBDR45U6UCFTRONH5RRYTFJMZT","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":"7873a4ad1649771efb530c17d4287378c401913987b5cb9bbf58610c9b7853e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-29T05:51:23Z","title_canon_sha256":"938c62a54cf7b8a6f1b70447d5180c0b6fad487f592e4ba3371a6c55ef4c8622"},"schema_version":"1.0","source":{"id":"1412.0073","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0073","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0073v2","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0073","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"JBDR45U6UCFT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JBDR45U6UCFTRONH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JBDR45U6","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:afde823377f7555bf4b86f8217bcbcae2de0aad5b5ec11501a43a557fd272754","target":"graph","created_at":"2026-05-18T02:19:18Z","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":"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","authors_text":"Jingcheng Liu, Pinyan Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-29T05:51:23Z","title":"FPTAS for #BIS with Degree Bounds on One Side"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0073","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:c8c3676b3b4531d2ed282ca81ff42eef87465e46504c799c9372a909bc1ad16b","target":"record","created_at":"2026-05-18T02:19:18Z","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":"7873a4ad1649771efb530c17d4287378c401913987b5cb9bbf58610c9b7853e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-29T05:51:23Z","title_canon_sha256":"938c62a54cf7b8a6f1b70447d5180c0b6fad487f592e4ba3371a6c55ef4c8622"},"schema_version":"1.0","source":{"id":"1412.0073","kind":"arxiv","version":2}},"canonical_sha256":"48471e769ea08b38b9a7ec6389952cccd1d45ce69530b63c95f2779765ab3f63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48471e769ea08b38b9a7ec6389952cccd1d45ce69530b63c95f2779765ab3f63","first_computed_at":"2026-05-18T02:19:18.673301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:18.673301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gx68KTePlpTVAKK9pk6Fiz/xEho09AIfxoFsS1Vaw0vfg1qbcZ2FQkWHdNyNcrfM0MMGaywZ+azwet1uGZKCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:18.673882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0073","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8c3676b3b4531d2ed282ca81ff42eef87465e46504c799c9372a909bc1ad16b","sha256:afde823377f7555bf4b86f8217bcbcae2de0aad5b5ec11501a43a557fd272754"],"state_sha256":"b1dfcbbdbd51c789c5538a4428bdb11fc8e473fc86c1e74bd1d9ceabe8abb1d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+eobd4kB7tq9sO2RTCvTZvDW5u2/4wRuSBHKmfe+u8I0JfZJQOBsB5/wSsPRBFjRqWyh8+OPxeWEgHilWD/4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:22:53.863201Z","bundle_sha256":"31eda5d61e4846cfd3ef6d70d1de604f066b74470c465ae3d5dc5ef11e86a49b"}}