{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VH5FQ2BUOIWNUNUKVV44RFUNUB","short_pith_number":"pith:VH5FQ2BU","canonical_record":{"source":{"id":"1604.01116","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-05T02:42:48Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0c7a1c54f0843e5c10a7032e31d000e23b21242962817cc75bcc8ab189124612","abstract_canon_sha256":"baed8d9e6aef4cbde3ea57e30b8ee3df50931503c373d736ac5ae609065d1afb"},"schema_version":"1.0"},"canonical_sha256":"a9fa586834722cda368aad79c8968da050bc591a8c798a724d2194c963d24b68","source":{"kind":"arxiv","id":"1604.01116","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01116","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01116v2","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01116","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"VH5FQ2BUOIWN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VH5FQ2BUOIWNUNUK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VH5FQ2BU","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VH5FQ2BUOIWNUNUKVV44RFUNUB","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01116","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-05T02:42:48Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0c7a1c54f0843e5c10a7032e31d000e23b21242962817cc75bcc8ab189124612","abstract_canon_sha256":"baed8d9e6aef4cbde3ea57e30b8ee3df50931503c373d736ac5ae609065d1afb"},"schema_version":"1.0"},"canonical_sha256":"a9fa586834722cda368aad79c8968da050bc591a8c798a724d2194c963d24b68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:16.628103Z","signature_b64":"uS2zXUP74Dqk36ntIxQX9tsBEczb4z6w7BL0ThYZvglXdftfClg3ZvzdJ08yxfo77rwNDNx7Ket3El8eR8kzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9fa586834722cda368aad79c8968da050bc591a8c798a724d2194c963d24b68","last_reissued_at":"2026-05-18T01:17:16.627136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:16.627136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01116","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-18T01:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JB7kr9BqOsO3n7EkCrHOabarJPlqg+MIX648xtMNzrUZ2gUaqGadUyw7hRSKDbwW7R6Wy7RVr/guLPyTWQ5ICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:12:12.033509Z"},"content_sha256":"b8cfa678c57a5632ba043b28a39adcb6d2bc9f6ea2b58a0aa3f339ced0f713a5","schema_version":"1.0","event_id":"sha256:b8cfa678c57a5632ba043b28a39adcb6d2bc9f6ea2b58a0aa3f339ced0f713a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VH5FQ2BUOIWNUNUKVV44RFUNUB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing the Weighted Number of Spanning Trees: Near-$t$-Optimal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Gamini Dissanayake, Gaurav S. Sukhatme, Kasra Khosoussi, Shoudong Huang","submitted_at":"2016-04-05T02:42:48Z","abstract_excerpt":"Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a key role in, e.g., network reliability under random edge failure, estimation over networks and D-optimal experimental designs. This paper tackles the open problem of designing graphs with the maximum weighted number of spanning trees under various constraints. We reveal several new structures, such as the log-submodularity of the weighted number of spanning t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01116","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-18T01:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYESBc1jDqLJQTLFVT8UycCEGTOVgC1I/aUSxBXHkGJJIZpemtytcjEWtLdiE89NIXAddLX8L3lYVUioTwCZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:12:12.033901Z"},"content_sha256":"e803d824d73fe24c87b91a6a765236c6b6cc8d464b3fcabe2762e7cee53c8af9","schema_version":"1.0","event_id":"sha256:e803d824d73fe24c87b91a6a765236c6b6cc8d464b3fcabe2762e7cee53c8af9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VH5FQ2BUOIWNUNUKVV44RFUNUB/bundle.json","state_url":"https://pith.science/pith/VH5FQ2BUOIWNUNUKVV44RFUNUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VH5FQ2BUOIWNUNUKVV44RFUNUB/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-27T02:12:12Z","links":{"resolver":"https://pith.science/pith/VH5FQ2BUOIWNUNUKVV44RFUNUB","bundle":"https://pith.science/pith/VH5FQ2BUOIWNUNUKVV44RFUNUB/bundle.json","state":"https://pith.science/pith/VH5FQ2BUOIWNUNUKVV44RFUNUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VH5FQ2BUOIWNUNUKVV44RFUNUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VH5FQ2BUOIWNUNUKVV44RFUNUB","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":"baed8d9e6aef4cbde3ea57e30b8ee3df50931503c373d736ac5ae609065d1afb","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-05T02:42:48Z","title_canon_sha256":"0c7a1c54f0843e5c10a7032e31d000e23b21242962817cc75bcc8ab189124612"},"schema_version":"1.0","source":{"id":"1604.01116","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01116","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01116v2","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01116","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"VH5FQ2BUOIWN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VH5FQ2BUOIWNUNUK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VH5FQ2BU","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:e803d824d73fe24c87b91a6a765236c6b6cc8d464b3fcabe2762e7cee53c8af9","target":"graph","created_at":"2026-05-18T01:17:16Z","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":"Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a key role in, e.g., network reliability under random edge failure, estimation over networks and D-optimal experimental designs. This paper tackles the open problem of designing graphs with the maximum weighted number of spanning trees under various constraints. We reveal several new structures, such as the log-submodularity of the weighted number of spanning t","authors_text":"Gamini Dissanayake, Gaurav S. Sukhatme, Kasra Khosoussi, Shoudong Huang","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-05T02:42:48Z","title":"Maximizing the Weighted Number of Spanning Trees: Near-$t$-Optimal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01116","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:b8cfa678c57a5632ba043b28a39adcb6d2bc9f6ea2b58a0aa3f339ced0f713a5","target":"record","created_at":"2026-05-18T01:17:16Z","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":"baed8d9e6aef4cbde3ea57e30b8ee3df50931503c373d736ac5ae609065d1afb","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-05T02:42:48Z","title_canon_sha256":"0c7a1c54f0843e5c10a7032e31d000e23b21242962817cc75bcc8ab189124612"},"schema_version":"1.0","source":{"id":"1604.01116","kind":"arxiv","version":2}},"canonical_sha256":"a9fa586834722cda368aad79c8968da050bc591a8c798a724d2194c963d24b68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9fa586834722cda368aad79c8968da050bc591a8c798a724d2194c963d24b68","first_computed_at":"2026-05-18T01:17:16.627136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:16.627136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uS2zXUP74Dqk36ntIxQX9tsBEczb4z6w7BL0ThYZvglXdftfClg3ZvzdJ08yxfo77rwNDNx7Ket3El8eR8kzCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:16.628103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01116","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8cfa678c57a5632ba043b28a39adcb6d2bc9f6ea2b58a0aa3f339ced0f713a5","sha256:e803d824d73fe24c87b91a6a765236c6b6cc8d464b3fcabe2762e7cee53c8af9"],"state_sha256":"98091c83f9d2d5fa53ff4bd0cbddb18f02d328a273f0ea4113a7ad0ebe985cde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0DhSj/r+jXRPgse7LazGpLwIwA8648Buc/m2juDyxoNo2GIxxk7O6Ze0cuKGMo6C7qyWyTKv0Ct2vVkUc9sUDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:12:12.036600Z","bundle_sha256":"c8b49f23198233fb1b8222225108e5c6518e8eede6e41a1023a8785e165ed7f5"}}