{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:H6TPGIWFCCAS3FNEDEMWRXXO7S","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":"b354eea4c2a8ff6dc0bdd02f3f1ebf56308f84e54e6d5b1f28a89463a0d303d8","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T07:01:16Z","title_canon_sha256":"50095af12f9fba969c91d9bcd40b007aca5b0c44641e0bf23fec3bf0f4e38967"},"schema_version":"1.0","source":{"id":"1307.2347","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2347","created_at":"2026-05-18T03:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2347v2","created_at":"2026-05-18T03:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2347","created_at":"2026-05-18T03:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"H6TPGIWFCCAS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H6TPGIWFCCAS3FNE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H6TPGIWF","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:5cb39f30d5b44344943cf4f3d906a426e7e00105f1d245037f77fc55bee7dc51","target":"graph","created_at":"2026-05-18T03:06:54Z","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":"Given a combinatorial decomposition for a counting problem, we resort to the simple scheme of approximating large numbers by floating-point representations in order to obtain efficient Fully Polynomial Time Approximation Schemes (FPTASes) for it. The number of bits employed for the exponent and the mantissa will depend on the error parameter $0 < \\varepsilon \\leq 1$ and on the characteristics of the problem. Accordingly, we propose the first FPTASes with $1 \\pm \\varepsilon$ relative error for counting and generating uniformly at random a labeled DAG with a given number of vertices. This is acc","authors_text":"Alexandru I. Tomescu, Romeo Rizzi","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T07:01:16Z","title":"Combinatorial decomposition approaches for efficient counting and random generation FPTASes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2347","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:3dce97aa8c351790415f1fb2b71f3ea7995fb258234aee56ec72060c5251260d","target":"record","created_at":"2026-05-18T03:06:54Z","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":"b354eea4c2a8ff6dc0bdd02f3f1ebf56308f84e54e6d5b1f28a89463a0d303d8","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T07:01:16Z","title_canon_sha256":"50095af12f9fba969c91d9bcd40b007aca5b0c44641e0bf23fec3bf0f4e38967"},"schema_version":"1.0","source":{"id":"1307.2347","kind":"arxiv","version":2}},"canonical_sha256":"3fa6f322c510812d95a4191968deeefc97de65aedafeecb377be0866f2714b80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fa6f322c510812d95a4191968deeefc97de65aedafeecb377be0866f2714b80","first_computed_at":"2026-05-18T03:06:54.770966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:54.770966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IUtD5Ln62TB1/5WAeTft6u6v4rypAYKNTc7FoXyWq2GJD4TTTpTWEwJqDESXD96FAaiUj0klLIjGUs/VXdAaDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:54.771568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2347","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dce97aa8c351790415f1fb2b71f3ea7995fb258234aee56ec72060c5251260d","sha256:5cb39f30d5b44344943cf4f3d906a426e7e00105f1d245037f77fc55bee7dc51"],"state_sha256":"5be8f29183735361bcfcfec3020a91545cc5f2307c6ed2eada03de346c03584b"}