{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5ZETSI7IL7OFFMV4X2SLX7TTR6","short_pith_number":"pith:5ZETSI7I","canonical_record":{"source":{"id":"1804.02785","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-09T01:20:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"37722ea89bb6b2ace1928880d9a5053532d7819d6421694fb24612ff4d2d6b80","abstract_canon_sha256":"835d540c762df2339ea4f791cd888aa5d4aee819fff93e131877c12fbe66d3a4"},"schema_version":"1.0"},"canonical_sha256":"ee493923e85fdc52b2bcbea4bbfe738f97681d42943a7894736be05ec459b480","source":{"kind":"arxiv","id":"1804.02785","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02785","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02785v2","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02785","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"5ZETSI7IL7OF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5ZETSI7IL7OFFMV4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5ZETSI7I","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5ZETSI7IL7OFFMV4X2SLX7TTR6","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02785","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-09T01:20:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"37722ea89bb6b2ace1928880d9a5053532d7819d6421694fb24612ff4d2d6b80","abstract_canon_sha256":"835d540c762df2339ea4f791cd888aa5d4aee819fff93e131877c12fbe66d3a4"},"schema_version":"1.0"},"canonical_sha256":"ee493923e85fdc52b2bcbea4bbfe738f97681d42943a7894736be05ec459b480","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:46.548580Z","signature_b64":"/dH5YDQQv2qXlCKXfOsKOk77CBlS/kC40wlri0LfZsfacJMSOojBYJdYpAN8Ssb/kmLLSm9vA66DkSm0U0NgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee493923e85fdc52b2bcbea4bbfe738f97681d42943a7894736be05ec459b480","last_reissued_at":"2026-05-18T00:10:46.547914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:46.547914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02785","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-18T00:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4onEz9PLr55f13ke7yPlqgGXyttWaempA1HsRtroAT4581SxI9I5Vg8iBqrbjx7hsGenvIjXBrfybt3qaIZfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:22:57.963672Z"},"content_sha256":"be103da77890b5ef5c9e605bda8225804af65128e55adedcbfe0f593e778e4b2","schema_version":"1.0","event_id":"sha256:be103da77890b5ef5c9e605bda8225804af65128e55adedcbfe0f593e778e4b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5ZETSI7IL7OFFMV4X2SLX7TTR6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing the Number of Spanning Trees in a Connected Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Huan Li, Stacy Patterson, Yuhao Yi, Zhongzhi Zhang","submitted_at":"2018-04-09T01:20:38Z","abstract_excerpt":"We study the problem of maximizing the number of spanning trees in a connected graph by adding at most $k$ edges from a given candidate edge set. We give both algorithmic and hardness results for this problem:\n  - We give a greedy algorithm that, using submodularity, obtains an approximation ratio of $(1 - 1/e - \\epsilon)$ in the exponent of the number of spanning trees for any $\\epsilon > 0$ in time $\\tilde{O}(m \\epsilon^{-1} + (n + q) \\epsilon^{-3})$, where $m$ and $q$ is the number of edges in the original graph and the candidate edge set, respectively. Our running time is optimal with resp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02785","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-18T00:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tuh9InX/5xvEZwPisIr6anATd+jVQjmUNGNl13TRXR4u5kAh+wBSm3GyuxJjQmrugDAEUnNAubQzdFjt5NzCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:22:57.964327Z"},"content_sha256":"fa26029aa9c1faf6bead2d1bbebe6194e5fcfee8812f3dc9e9d83de5487b3cb9","schema_version":"1.0","event_id":"sha256:fa26029aa9c1faf6bead2d1bbebe6194e5fcfee8812f3dc9e9d83de5487b3cb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZETSI7IL7OFFMV4X2SLX7TTR6/bundle.json","state_url":"https://pith.science/pith/5ZETSI7IL7OFFMV4X2SLX7TTR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZETSI7IL7OFFMV4X2SLX7TTR6/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-06-07T17:22:57Z","links":{"resolver":"https://pith.science/pith/5ZETSI7IL7OFFMV4X2SLX7TTR6","bundle":"https://pith.science/pith/5ZETSI7IL7OFFMV4X2SLX7TTR6/bundle.json","state":"https://pith.science/pith/5ZETSI7IL7OFFMV4X2SLX7TTR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZETSI7IL7OFFMV4X2SLX7TTR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5ZETSI7IL7OFFMV4X2SLX7TTR6","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":"835d540c762df2339ea4f791cd888aa5d4aee819fff93e131877c12fbe66d3a4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-09T01:20:38Z","title_canon_sha256":"37722ea89bb6b2ace1928880d9a5053532d7819d6421694fb24612ff4d2d6b80"},"schema_version":"1.0","source":{"id":"1804.02785","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02785","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02785v2","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02785","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"5ZETSI7IL7OF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5ZETSI7IL7OFFMV4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5ZETSI7I","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:fa26029aa9c1faf6bead2d1bbebe6194e5fcfee8812f3dc9e9d83de5487b3cb9","target":"graph","created_at":"2026-05-18T00:10:46Z","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 study the problem of maximizing the number of spanning trees in a connected graph by adding at most $k$ edges from a given candidate edge set. We give both algorithmic and hardness results for this problem:\n  - We give a greedy algorithm that, using submodularity, obtains an approximation ratio of $(1 - 1/e - \\epsilon)$ in the exponent of the number of spanning trees for any $\\epsilon > 0$ in time $\\tilde{O}(m \\epsilon^{-1} + (n + q) \\epsilon^{-3})$, where $m$ and $q$ is the number of edges in the original graph and the candidate edge set, respectively. Our running time is optimal with resp","authors_text":"Huan Li, Stacy Patterson, Yuhao Yi, Zhongzhi Zhang","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-09T01:20:38Z","title":"Maximizing the Number of Spanning Trees in a Connected Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02785","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:be103da77890b5ef5c9e605bda8225804af65128e55adedcbfe0f593e778e4b2","target":"record","created_at":"2026-05-18T00:10:46Z","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":"835d540c762df2339ea4f791cd888aa5d4aee819fff93e131877c12fbe66d3a4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-09T01:20:38Z","title_canon_sha256":"37722ea89bb6b2ace1928880d9a5053532d7819d6421694fb24612ff4d2d6b80"},"schema_version":"1.0","source":{"id":"1804.02785","kind":"arxiv","version":2}},"canonical_sha256":"ee493923e85fdc52b2bcbea4bbfe738f97681d42943a7894736be05ec459b480","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee493923e85fdc52b2bcbea4bbfe738f97681d42943a7894736be05ec459b480","first_computed_at":"2026-05-18T00:10:46.547914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:46.547914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/dH5YDQQv2qXlCKXfOsKOk77CBlS/kC40wlri0LfZsfacJMSOojBYJdYpAN8Ssb/kmLLSm9vA66DkSm0U0NgAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:46.548580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02785","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be103da77890b5ef5c9e605bda8225804af65128e55adedcbfe0f593e778e4b2","sha256:fa26029aa9c1faf6bead2d1bbebe6194e5fcfee8812f3dc9e9d83de5487b3cb9"],"state_sha256":"f2ff8197d6f8543f3ab8f7317fea1340bedd707e288b5bb632059de0484ece43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m4GOe2Bc4fZW0rtQXJIb8R0EX1GidLSCgzTfLg8+X5h4B05NJ03XQBGYbrQP6VyRcQLTYQnV2t+FzDFy6RW3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:22:57.967749Z","bundle_sha256":"059a5927aeb452bc57f8abdedc013ea23e2045d60574bcd63e9917fb8dad80d7"}}