{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JMHTG534NJTZMQD7APLNTVGIYA","short_pith_number":"pith:JMHTG534","schema_version":"1.0","canonical_sha256":"4b0f33777c6a6796407f03d6d9d4c8c010e6cbf2dceabb9f7d282eb88c565825","source":{"kind":"arxiv","id":"1307.7621","version":2},"attestation_state":"computed","paper":{"title":"Packing Steiner Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irene Pivotto, Jessica McDonald, Matt DeVos","submitted_at":"2013-07-29T15:46:17Z","abstract_excerpt":"Let $T$ be a distinguished subset of vertices in a graph $G$. A $T$-\\emph{Steiner tree} is a subgraph of $G$ that is a tree and that spans $T$. Kriesell conjectured that $G$ contains $k$ pairwise edge-disjoint $T$-Steiner trees provided that every edge-cut of $G$ that separates $T$ has size $\\ge 2k$. When $T=V(G)$ a $T$-Steiner tree is a spanning tree and the conjecture is a consequence of a classic theorem due to Nash-Williams and Tutte. Lau proved that Kriesell's conjecture holds when $2k$ is replaced by $24k$, and recently West and Wu have lowered this value to $6.5k$. Our main result makes"},"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":"1307.7621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-29T15:46:17Z","cross_cats_sorted":[],"title_canon_sha256":"2653018bd8178d719c283b031d9167435cb0740a49d684610dcac325f7b9bea2","abstract_canon_sha256":"f396aef755a32a76ba941b03adc89b08a3f637b6f3acdd7aa80e0ae7092ea6fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:38.516732Z","signature_b64":"Vk65FTzPN9eMlRwY8tQj67xPtxZElMXW1YKuUZ8NFvcEGciiArVG0srxoIyuS+8VnkG0XN5htzHXE1aIFuTZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b0f33777c6a6796407f03d6d9d4c8c010e6cbf2dceabb9f7d282eb88c565825","last_reissued_at":"2026-05-18T01:35:38.516083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:38.516083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing Steiner Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irene Pivotto, Jessica McDonald, Matt DeVos","submitted_at":"2013-07-29T15:46:17Z","abstract_excerpt":"Let $T$ be a distinguished subset of vertices in a graph $G$. A $T$-\\emph{Steiner tree} is a subgraph of $G$ that is a tree and that spans $T$. Kriesell conjectured that $G$ contains $k$ pairwise edge-disjoint $T$-Steiner trees provided that every edge-cut of $G$ that separates $T$ has size $\\ge 2k$. When $T=V(G)$ a $T$-Steiner tree is a spanning tree and the conjecture is a consequence of a classic theorem due to Nash-Williams and Tutte. Lau proved that Kriesell's conjecture holds when $2k$ is replaced by $24k$, and recently West and Wu have lowered this value to $6.5k$. Our main result makes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7621","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":"1307.7621","created_at":"2026-05-18T01:35:38.516178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7621v2","created_at":"2026-05-18T01:35:38.516178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7621","created_at":"2026-05-18T01:35:38.516178+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMHTG534NJTZ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMHTG534NJTZMQD7","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMHTG534","created_at":"2026-05-18T12:27:49.015174+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/JMHTG534NJTZMQD7APLNTVGIYA","json":"https://pith.science/pith/JMHTG534NJTZMQD7APLNTVGIYA.json","graph_json":"https://pith.science/api/pith-number/JMHTG534NJTZMQD7APLNTVGIYA/graph.json","events_json":"https://pith.science/api/pith-number/JMHTG534NJTZMQD7APLNTVGIYA/events.json","paper":"https://pith.science/paper/JMHTG534"},"agent_actions":{"view_html":"https://pith.science/pith/JMHTG534NJTZMQD7APLNTVGIYA","download_json":"https://pith.science/pith/JMHTG534NJTZMQD7APLNTVGIYA.json","view_paper":"https://pith.science/paper/JMHTG534","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7621&json=true","fetch_graph":"https://pith.science/api/pith-number/JMHTG534NJTZMQD7APLNTVGIYA/graph.json","fetch_events":"https://pith.science/api/pith-number/JMHTG534NJTZMQD7APLNTVGIYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMHTG534NJTZMQD7APLNTVGIYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMHTG534NJTZMQD7APLNTVGIYA/action/storage_attestation","attest_author":"https://pith.science/pith/JMHTG534NJTZMQD7APLNTVGIYA/action/author_attestation","sign_citation":"https://pith.science/pith/JMHTG534NJTZMQD7APLNTVGIYA/action/citation_signature","submit_replication":"https://pith.science/pith/JMHTG534NJTZMQD7APLNTVGIYA/action/replication_record"}},"created_at":"2026-05-18T01:35:38.516178+00:00","updated_at":"2026-05-18T01:35:38.516178+00:00"}