{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5XF2UTIYQOZZ5Y55KD3PT3WV37","short_pith_number":"pith:5XF2UTIY","schema_version":"1.0","canonical_sha256":"edcbaa4d1883b39ee3bd50f6f9eed5dff80a41eeec468e9ccb05a1b61bc6ad56","source":{"kind":"arxiv","id":"1012.2478","version":2},"attestation_state":"computed","paper":{"title":"Packing spanning trees and the $k$-tree protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens, Robert F. Bailey","submitted_at":"2010-12-11T18:48:34Z","abstract_excerpt":"We provide a structural description of, and invariants for, maximum spanning tree-packable graphs, i.e. those graphs G for which the edge connectivity of G is equal to the maximum number of edge-disjoint spanning trees in G. These graphs are of interest for the k-tree protocol of Itai and Rodeh [Inform. and Comput. 79 (1988), 43-59]."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1012.2478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-11T18:48:34Z","cross_cats_sorted":[],"title_canon_sha256":"0d71023ac9eb4e80b9c23474bae360c812be441efe68217976327c7863d416b1","abstract_canon_sha256":"514f133fddce9cb1f63c2309065178efe12670b8e7908504d4cd0e8dc2f571c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:49.583652Z","signature_b64":"P+2fW87zcnN+8ZwjhohxD2rVaQCYJL7IX6OuZff6hSPL4GxZtxZTURuwPB4L59F+Sz+luDEZbVGAN8Z1I2M7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edcbaa4d1883b39ee3bd50f6f9eed5dff80a41eeec468e9ccb05a1b61bc6ad56","last_reissued_at":"2026-05-18T04:00:49.582998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:49.582998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing spanning trees and the $k$-tree protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens, Robert F. Bailey","submitted_at":"2010-12-11T18:48:34Z","abstract_excerpt":"We provide a structural description of, and invariants for, maximum spanning tree-packable graphs, i.e. those graphs G for which the edge connectivity of G is equal to the maximum number of edge-disjoint spanning trees in G. These graphs are of interest for the k-tree protocol of Itai and Rodeh [Inform. and Comput. 79 (1988), 43-59]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2478","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.2478","created_at":"2026-05-18T04:00:49.583127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2478v2","created_at":"2026-05-18T04:00:49.583127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2478","created_at":"2026-05-18T04:00:49.583127+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XF2UTIYQOZZ","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XF2UTIYQOZZ5Y55","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XF2UTIY","created_at":"2026-05-18T12:26:04.259169+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5XF2UTIYQOZZ5Y55KD3PT3WV37","json":"https://pith.science/pith/5XF2UTIYQOZZ5Y55KD3PT3WV37.json","graph_json":"https://pith.science/api/pith-number/5XF2UTIYQOZZ5Y55KD3PT3WV37/graph.json","events_json":"https://pith.science/api/pith-number/5XF2UTIYQOZZ5Y55KD3PT3WV37/events.json","paper":"https://pith.science/paper/5XF2UTIY"},"agent_actions":{"view_html":"https://pith.science/pith/5XF2UTIYQOZZ5Y55KD3PT3WV37","download_json":"https://pith.science/pith/5XF2UTIYQOZZ5Y55KD3PT3WV37.json","view_paper":"https://pith.science/paper/5XF2UTIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2478&json=true","fetch_graph":"https://pith.science/api/pith-number/5XF2UTIYQOZZ5Y55KD3PT3WV37/graph.json","fetch_events":"https://pith.science/api/pith-number/5XF2UTIYQOZZ5Y55KD3PT3WV37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XF2UTIYQOZZ5Y55KD3PT3WV37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XF2UTIYQOZZ5Y55KD3PT3WV37/action/storage_attestation","attest_author":"https://pith.science/pith/5XF2UTIYQOZZ5Y55KD3PT3WV37/action/author_attestation","sign_citation":"https://pith.science/pith/5XF2UTIYQOZZ5Y55KD3PT3WV37/action/citation_signature","submit_replication":"https://pith.science/pith/5XF2UTIYQOZZ5Y55KD3PT3WV37/action/replication_record"}},"created_at":"2026-05-18T04:00:49.583127+00:00","updated_at":"2026-05-18T04:00:49.583127+00:00"}