{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HLDOZANTODKSVT2OZCNWKBJCVC","short_pith_number":"pith:HLDOZANT","canonical_record":{"source":{"id":"1309.6115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-24T11:35:18Z","cross_cats_sorted":[],"title_canon_sha256":"72709f2f42db82e2e191fd50d621f3a458b84f3f7284756c50812f65afc8f389","abstract_canon_sha256":"0bb23f9d22df9e9191561f022a1cfb40cd85f7ec7cfc60d1e24f7b77eca054a4"},"schema_version":"1.0"},"canonical_sha256":"3ac6ec81b370d52acf4ec89b650522a89901c89d71e23b7c4d0be46451c06672","source":{"kind":"arxiv","id":"1309.6115","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6115","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6115v2","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6115","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"HLDOZANTODKS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HLDOZANTODKSVT2O","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HLDOZANT","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HLDOZANTODKSVT2OZCNWKBJCVC","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-24T11:35:18Z","cross_cats_sorted":[],"title_canon_sha256":"72709f2f42db82e2e191fd50d621f3a458b84f3f7284756c50812f65afc8f389","abstract_canon_sha256":"0bb23f9d22df9e9191561f022a1cfb40cd85f7ec7cfc60d1e24f7b77eca054a4"},"schema_version":"1.0"},"canonical_sha256":"3ac6ec81b370d52acf4ec89b650522a89901c89d71e23b7c4d0be46451c06672","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:53.169338Z","signature_b64":"HZmCw25EhWZxZm1Anl5cv3Ifj2iz5iVEaFecr+5VA5PCZ2AjCLn893vJMNpiQihkiXhpSu0P5x+JbfpclmueAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ac6ec81b370d52acf4ec89b650522a89901c89d71e23b7c4d0be46451c06672","last_reissued_at":"2026-05-18T02:38:53.168938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:53.168938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6115","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:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6cUeY2Z8tdo+vpgpl/1Lc7vp80V+zvBVGN8/xYt22FOV4DA0A504y3oqmdz6C0DmRfTHLLsUDtPI49A1ZGtnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:28:55.149685Z"},"content_sha256":"54cbdc1f4915a0cd90d7d0f816270fb2c447c9fe58c8464bea51e9b2d5a4ab05","schema_version":"1.0","event_id":"sha256:54cbdc1f4915a0cd90d7d0f816270fb2c447c9fe58c8464bea51e9b2d5a4ab05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HLDOZANTODKSVT2OZCNWKBJCVC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple FPTAS for Counting Edge Covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chengyu Lin, Jingcheng Liu, Pinyan Lu","submitted_at":"2013-09-24T11:35:18Z","abstract_excerpt":"An edge cover of a graph is a set of edges such that every vertex has at least an adjacent edge in it. Previously, approximation algorithm for counting edge covers is only known for 3 regular graphs and it is randomized. We design a very simple deterministic fully polynomial-time approximation scheme (FPTAS) for counting the number of edge covers for any graph. Our main technique is correlation decay, which is a powerful tool to design FPTAS for counting problems. In order to get FPTAS for general graphs without degree bound, we make use of a stronger notion called computationally efficient co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6115","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:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8owUDiFiIwTt8LNLcKLRFrHxQkRvuBuB+TPnWJThy4TltgJ6A2x2hWiJpoqL+36+KuVC+2jAUh98W+lREUgrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:28:55.150332Z"},"content_sha256":"67c10395020928b61a9f9e38d50c04eda9281e8221254e197f81af4e447404da","schema_version":"1.0","event_id":"sha256:67c10395020928b61a9f9e38d50c04eda9281e8221254e197f81af4e447404da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLDOZANTODKSVT2OZCNWKBJCVC/bundle.json","state_url":"https://pith.science/pith/HLDOZANTODKSVT2OZCNWKBJCVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLDOZANTODKSVT2OZCNWKBJCVC/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-28T16:28:55Z","links":{"resolver":"https://pith.science/pith/HLDOZANTODKSVT2OZCNWKBJCVC","bundle":"https://pith.science/pith/HLDOZANTODKSVT2OZCNWKBJCVC/bundle.json","state":"https://pith.science/pith/HLDOZANTODKSVT2OZCNWKBJCVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLDOZANTODKSVT2OZCNWKBJCVC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HLDOZANTODKSVT2OZCNWKBJCVC","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":"0bb23f9d22df9e9191561f022a1cfb40cd85f7ec7cfc60d1e24f7b77eca054a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-24T11:35:18Z","title_canon_sha256":"72709f2f42db82e2e191fd50d621f3a458b84f3f7284756c50812f65afc8f389"},"schema_version":"1.0","source":{"id":"1309.6115","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6115","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6115v2","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6115","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"HLDOZANTODKS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HLDOZANTODKSVT2O","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HLDOZANT","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:67c10395020928b61a9f9e38d50c04eda9281e8221254e197f81af4e447404da","target":"graph","created_at":"2026-05-18T02:38:53Z","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":"An edge cover of a graph is a set of edges such that every vertex has at least an adjacent edge in it. Previously, approximation algorithm for counting edge covers is only known for 3 regular graphs and it is randomized. We design a very simple deterministic fully polynomial-time approximation scheme (FPTAS) for counting the number of edge covers for any graph. Our main technique is correlation decay, which is a powerful tool to design FPTAS for counting problems. In order to get FPTAS for general graphs without degree bound, we make use of a stronger notion called computationally efficient co","authors_text":"Chengyu Lin, Jingcheng Liu, Pinyan Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-24T11:35:18Z","title":"A Simple FPTAS for Counting Edge Covers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6115","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:54cbdc1f4915a0cd90d7d0f816270fb2c447c9fe58c8464bea51e9b2d5a4ab05","target":"record","created_at":"2026-05-18T02:38:53Z","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":"0bb23f9d22df9e9191561f022a1cfb40cd85f7ec7cfc60d1e24f7b77eca054a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-24T11:35:18Z","title_canon_sha256":"72709f2f42db82e2e191fd50d621f3a458b84f3f7284756c50812f65afc8f389"},"schema_version":"1.0","source":{"id":"1309.6115","kind":"arxiv","version":2}},"canonical_sha256":"3ac6ec81b370d52acf4ec89b650522a89901c89d71e23b7c4d0be46451c06672","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ac6ec81b370d52acf4ec89b650522a89901c89d71e23b7c4d0be46451c06672","first_computed_at":"2026-05-18T02:38:53.168938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:53.168938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HZmCw25EhWZxZm1Anl5cv3Ifj2iz5iVEaFecr+5VA5PCZ2AjCLn893vJMNpiQihkiXhpSu0P5x+JbfpclmueAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:53.169338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6115","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54cbdc1f4915a0cd90d7d0f816270fb2c447c9fe58c8464bea51e9b2d5a4ab05","sha256:67c10395020928b61a9f9e38d50c04eda9281e8221254e197f81af4e447404da"],"state_sha256":"47557a5afb7d15f4c8ab659c7e45e12b3ea7cd1818556c9817a5369ba4800178"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6IHCd9XUAmOeHxHCi8TQsyQ5GfS0TgvU/GQzniPN0oMNcx3oqeusseCpw2H19T9Ix1YT44+Bhd6m1SldjHPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:28:55.153456Z","bundle_sha256":"a683661ab88a29352793de7c74f1eda6098510e93bccd464da2a2a8ea79c0502"}}