{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:E66N2ADXHA3WTSEVGOSYSVXZGD","short_pith_number":"pith:E66N2ADX","schema_version":"1.0","canonical_sha256":"27bcdd0077383769c89533a58956f930fb5b02e9ccacf87146eec286f2d66634","source":{"kind":"arxiv","id":"2506.23970","version":1},"attestation_state":"computed","paper":{"title":"Approximate Itai-Zehavi conjecture for random graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adva Mond, Julien Portier, Lawrence Hollom, Lyuben Lichev, Yiting Wang","submitted_at":"2025-06-30T15:37:37Z","abstract_excerpt":"A famous conjecture by Itai and Zehavi states that, for every $d$-vertex-connected graph $G$ and every vertex $r$ in $G$, there are $d$ spanning trees of $G$ such that, for every vertex $v$ in $G\\setminus \\{r\\}$, the paths between $r$ and $v$ in different trees are internally vertex-disjoint. We show that with high probability the Itai-Zehavi conjecture holds asymptotically for the Erd\\H{o}s-R\\'enyi random graph $G(n,p)$ when $np= \\omega(\\log n)$ and for random regular graphs $G(n,d)$ when $d= \\omega(\\log n)$. Moreover, we essentially confirm the conjecture up to a constant factor for sparser "},"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":"2506.23970","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T15:37:37Z","cross_cats_sorted":[],"title_canon_sha256":"7fedbcbf8c5af3941de69f601ff4f3854bb84bd49cceb610f0d2e66c067f053f","abstract_canon_sha256":"ca548c0ccc8c369ebbd65c2df174a0b630bc30d7bb58bd1720ce501cffb7ffd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:30.945649Z","signature_b64":"G3HpAqd0ZX9WDwd4mluPZjNn02Zt7MrtpA7XK2ozPjhX6ahevpfF11c//QMtLNM05BOAgQ2csRHV7XTRxFk3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27bcdd0077383769c89533a58956f930fb5b02e9ccacf87146eec286f2d66634","last_reissued_at":"2026-07-05T11:29:30.945217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:30.945217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Itai-Zehavi conjecture for random graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adva Mond, Julien Portier, Lawrence Hollom, Lyuben Lichev, Yiting Wang","submitted_at":"2025-06-30T15:37:37Z","abstract_excerpt":"A famous conjecture by Itai and Zehavi states that, for every $d$-vertex-connected graph $G$ and every vertex $r$ in $G$, there are $d$ spanning trees of $G$ such that, for every vertex $v$ in $G\\setminus \\{r\\}$, the paths between $r$ and $v$ in different trees are internally vertex-disjoint. We show that with high probability the Itai-Zehavi conjecture holds asymptotically for the Erd\\H{o}s-R\\'enyi random graph $G(n,p)$ when $np= \\omega(\\log n)$ and for random regular graphs $G(n,d)$ when $d= \\omega(\\log n)$. Moreover, we essentially confirm the conjecture up to a constant factor for sparser "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23970","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.23970/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.23970","created_at":"2026-07-05T11:29:30.945280+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23970v1","created_at":"2026-07-05T11:29:30.945280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23970","created_at":"2026-07-05T11:29:30.945280+00:00"},{"alias_kind":"pith_short_12","alias_value":"E66N2ADXHA3W","created_at":"2026-07-05T11:29:30.945280+00:00"},{"alias_kind":"pith_short_16","alias_value":"E66N2ADXHA3WTSEV","created_at":"2026-07-05T11:29:30.945280+00:00"},{"alias_kind":"pith_short_8","alias_value":"E66N2ADX","created_at":"2026-07-05T11:29:30.945280+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/E66N2ADXHA3WTSEVGOSYSVXZGD","json":"https://pith.science/pith/E66N2ADXHA3WTSEVGOSYSVXZGD.json","graph_json":"https://pith.science/api/pith-number/E66N2ADXHA3WTSEVGOSYSVXZGD/graph.json","events_json":"https://pith.science/api/pith-number/E66N2ADXHA3WTSEVGOSYSVXZGD/events.json","paper":"https://pith.science/paper/E66N2ADX"},"agent_actions":{"view_html":"https://pith.science/pith/E66N2ADXHA3WTSEVGOSYSVXZGD","download_json":"https://pith.science/pith/E66N2ADXHA3WTSEVGOSYSVXZGD.json","view_paper":"https://pith.science/paper/E66N2ADX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23970&json=true","fetch_graph":"https://pith.science/api/pith-number/E66N2ADXHA3WTSEVGOSYSVXZGD/graph.json","fetch_events":"https://pith.science/api/pith-number/E66N2ADXHA3WTSEVGOSYSVXZGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E66N2ADXHA3WTSEVGOSYSVXZGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E66N2ADXHA3WTSEVGOSYSVXZGD/action/storage_attestation","attest_author":"https://pith.science/pith/E66N2ADXHA3WTSEVGOSYSVXZGD/action/author_attestation","sign_citation":"https://pith.science/pith/E66N2ADXHA3WTSEVGOSYSVXZGD/action/citation_signature","submit_replication":"https://pith.science/pith/E66N2ADXHA3WTSEVGOSYSVXZGD/action/replication_record"}},"created_at":"2026-07-05T11:29:30.945280+00:00","updated_at":"2026-07-05T11:29:30.945280+00:00"}