{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZARDKWXVE2VALZDFRLXRMBO4OK","short_pith_number":"pith:ZARDKWXV","canonical_record":{"source":{"id":"1903.07531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-18T16:17:36Z","cross_cats_sorted":[],"title_canon_sha256":"e173d5403408f50e508d6c860677902a3e161204850c006bc06b3101de9b6ebb","abstract_canon_sha256":"643d3799c5a2e5da55c77c644507b8c0f3a3ea4c94d9df06592b81f0704bdedf"},"schema_version":"1.0"},"canonical_sha256":"c822355af526aa05e4658aef1605dc72b99e5c3ab5c85276efe7c0363ab97cae","source":{"kind":"arxiv","id":"1903.07531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07531","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07531v1","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07531","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZARDKWXVE2VA","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZARDKWXVE2VALZDF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZARDKWXV","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZARDKWXVE2VALZDFRLXRMBO4OK","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-18T16:17:36Z","cross_cats_sorted":[],"title_canon_sha256":"e173d5403408f50e508d6c860677902a3e161204850c006bc06b3101de9b6ebb","abstract_canon_sha256":"643d3799c5a2e5da55c77c644507b8c0f3a3ea4c94d9df06592b81f0704bdedf"},"schema_version":"1.0"},"canonical_sha256":"c822355af526aa05e4658aef1605dc72b99e5c3ab5c85276efe7c0363ab97cae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:01.131106Z","signature_b64":"EX4QCL+32YJCNEA0Y5moTIR2lZAonRDOEbY9Z7jIuN+vm1pagttK2qCostCDfcLUx7XotG9AnENdy63nM6/AAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c822355af526aa05e4658aef1605dc72b99e5c3ab5c85276efe7c0363ab97cae","last_reissued_at":"2026-05-17T23:51:01.130434Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:01.130434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07531","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-17T23:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFpO6P6KJQjdWxEUa8NBJ6US2GZJpraC6bYZGC5mLYaGcBMGKdocLmVGcp8wrgK9LnaCaU3tIw2Fv0JPdf9YDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T15:09:39.012821Z"},"content_sha256":"e5f583b6ebadfcd6dfd9c1687c564a772a34eb37e410c664353502a466877080","schema_version":"1.0","event_id":"sha256:e5f583b6ebadfcd6dfd9c1687c564a772a34eb37e410c664353502a466877080"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZARDKWXVE2VALZDFRLXRMBO4OK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting independent sets and colorings on random regular bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao","submitted_at":"2019-03-18T16:17:36Z","abstract_excerpt":"We give a fully polynomial-time approximation scheme (FPTAS) to count the number of independent sets on almost every $\\Delta$-regular bipartite graph if $\\Delta\\ge 53$. In the weighted case, for all sufficiently large integers $\\Delta$ and weight parameters $\\lambda=\\tilde\\Omega\\left(\\frac{1}{\\Delta}\\right)$, we also obtain an FPTAS on almost every $\\Delta$-regular bipartite graph. Our technique is based on the recent work of Jenssen, Keevash and Perkins (SODA, 2019) and we also apply it to confirm an open question raised there: For all $q\\ge 3$ and sufficiently large integers $\\Delta=\\Delta(q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07531","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-17T23:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R8c9V21B+gP3ki5/rKhk599MEov+MtzGBMt5htVeFohaRlt7TlALy1q8fqOeYQme/AWGcFYFukiFS5eYSebNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T15:09:39.013157Z"},"content_sha256":"28158ce90e4ab713a4b365e386430336b635b01623c3144ecf9ff917d22bc04e","schema_version":"1.0","event_id":"sha256:28158ce90e4ab713a4b365e386430336b635b01623c3144ecf9ff917d22bc04e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZARDKWXVE2VALZDFRLXRMBO4OK/bundle.json","state_url":"https://pith.science/pith/ZARDKWXVE2VALZDFRLXRMBO4OK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZARDKWXVE2VALZDFRLXRMBO4OK/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-20T15:09:39Z","links":{"resolver":"https://pith.science/pith/ZARDKWXVE2VALZDFRLXRMBO4OK","bundle":"https://pith.science/pith/ZARDKWXVE2VALZDFRLXRMBO4OK/bundle.json","state":"https://pith.science/pith/ZARDKWXVE2VALZDFRLXRMBO4OK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZARDKWXVE2VALZDFRLXRMBO4OK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZARDKWXVE2VALZDFRLXRMBO4OK","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":"643d3799c5a2e5da55c77c644507b8c0f3a3ea4c94d9df06592b81f0704bdedf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-18T16:17:36Z","title_canon_sha256":"e173d5403408f50e508d6c860677902a3e161204850c006bc06b3101de9b6ebb"},"schema_version":"1.0","source":{"id":"1903.07531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07531","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07531v1","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07531","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZARDKWXVE2VA","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZARDKWXVE2VALZDF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZARDKWXV","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:28158ce90e4ab713a4b365e386430336b635b01623c3144ecf9ff917d22bc04e","target":"graph","created_at":"2026-05-17T23:51:01Z","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 give a fully polynomial-time approximation scheme (FPTAS) to count the number of independent sets on almost every $\\Delta$-regular bipartite graph if $\\Delta\\ge 53$. In the weighted case, for all sufficiently large integers $\\Delta$ and weight parameters $\\lambda=\\tilde\\Omega\\left(\\frac{1}{\\Delta}\\right)$, we also obtain an FPTAS on almost every $\\Delta$-regular bipartite graph. Our technique is based on the recent work of Jenssen, Keevash and Perkins (SODA, 2019) and we also apply it to confirm an open question raised there: For all $q\\ge 3$ and sufficiently large integers $\\Delta=\\Delta(q","authors_text":"Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-18T16:17:36Z","title":"Counting independent sets and colorings on random regular bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07531","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:e5f583b6ebadfcd6dfd9c1687c564a772a34eb37e410c664353502a466877080","target":"record","created_at":"2026-05-17T23:51:01Z","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":"643d3799c5a2e5da55c77c644507b8c0f3a3ea4c94d9df06592b81f0704bdedf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-18T16:17:36Z","title_canon_sha256":"e173d5403408f50e508d6c860677902a3e161204850c006bc06b3101de9b6ebb"},"schema_version":"1.0","source":{"id":"1903.07531","kind":"arxiv","version":1}},"canonical_sha256":"c822355af526aa05e4658aef1605dc72b99e5c3ab5c85276efe7c0363ab97cae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c822355af526aa05e4658aef1605dc72b99e5c3ab5c85276efe7c0363ab97cae","first_computed_at":"2026-05-17T23:51:01.130434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:01.130434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EX4QCL+32YJCNEA0Y5moTIR2lZAonRDOEbY9Z7jIuN+vm1pagttK2qCostCDfcLUx7XotG9AnENdy63nM6/AAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:01.131106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5f583b6ebadfcd6dfd9c1687c564a772a34eb37e410c664353502a466877080","sha256:28158ce90e4ab713a4b365e386430336b635b01623c3144ecf9ff917d22bc04e"],"state_sha256":"524d7c38a0517f30f838d5f161f437e58e2cfb34378017447c905b9cd2dc5662"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kHnwN7X1zXksGMse/8Fy0cqzXU6sRxO9qkayfyVZ0OdyBeDYo6h7cJRoojiZtEt1I0RtK/bXffhGczlbVzYDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T15:09:39.015176Z","bundle_sha256":"25cd1ba62af5fb940f3131b918f014e3737bd8f0614d82040de397b4da3d2259"}}