{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AD4JL2LOB4JOYQCB65XBZSP6NT","short_pith_number":"pith:AD4JL2LO","schema_version":"1.0","canonical_sha256":"00f895e96e0f12ec4041f76e1cc9fe6cfebe4390cb1597658531eef494cdf446","source":{"kind":"arxiv","id":"1109.2696","version":2},"attestation_state":"computed","paper":{"title":"Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.NI","authors_text":"Cyril Gavoille (LaBRI, INRIA Bordeaux - Sud-Ouest, IUF), Laurent Viennot (INRIA Rocquencourt), Quentin Godfroy (LaBRI)","submitted_at":"2011-09-13T07:43:17Z","abstract_excerpt":"Motivated by multipath routing, we introduce a multi-connected variant of spanners. For that purpose we introduce the $p$-multipath cost between two nodes $u$ and $v$ as the minimum weight of a collection of $p$ internally vertex-disjoint paths between $u$ and $v$. Given a weighted graph $G$, a subgraph $H$ is a $p$-multipath $s$-spanner if for all $u,v$, the $p$-multipath cost between $u$ and $v$ in $H$ is at most $s$ times the $p$-multipath cost in $G$. The $s$ factor is called the stretch. Building upon recent results on fault-tolerant spanners, we show how to build $p$-multipath spanners o"},"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":"1109.2696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-09-13T07:43:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"21b4084a6a222ae83f5e8dbfd7e39f9395ad20dccb8d96ead93600b8eee5e134","abstract_canon_sha256":"5396b243b9b3b8b8dd4a552e19d739aab7d2d5a39854e204b4061f7bf8d4c018"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:55.532486Z","signature_b64":"cBp7PfMpp8ZDphMC4b7rVtRxxEZ+73E8oi8/TrdA6FjzBbAEjux5FhmFXrM+hDGTdQpTAk4+IdMDFwW+fyk9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00f895e96e0f12ec4041f76e1cc9fe6cfebe4390cb1597658531eef494cdf446","last_reissued_at":"2026-05-18T04:12:55.531787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:55.531787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.NI","authors_text":"Cyril Gavoille (LaBRI, INRIA Bordeaux - Sud-Ouest, IUF), Laurent Viennot (INRIA Rocquencourt), Quentin Godfroy (LaBRI)","submitted_at":"2011-09-13T07:43:17Z","abstract_excerpt":"Motivated by multipath routing, we introduce a multi-connected variant of spanners. For that purpose we introduce the $p$-multipath cost between two nodes $u$ and $v$ as the minimum weight of a collection of $p$ internally vertex-disjoint paths between $u$ and $v$. Given a weighted graph $G$, a subgraph $H$ is a $p$-multipath $s$-spanner if for all $u,v$, the $p$-multipath cost between $u$ and $v$ in $H$ is at most $s$ times the $p$-multipath cost in $G$. The $s$ factor is called the stretch. Building upon recent results on fault-tolerant spanners, we show how to build $p$-multipath spanners o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2696","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":"1109.2696","created_at":"2026-05-18T04:12:55.531921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2696v2","created_at":"2026-05-18T04:12:55.531921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2696","created_at":"2026-05-18T04:12:55.531921+00:00"},{"alias_kind":"pith_short_12","alias_value":"AD4JL2LOB4JO","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AD4JL2LOB4JOYQCB","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AD4JL2LO","created_at":"2026-05-18T12:26:24.575870+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/AD4JL2LOB4JOYQCB65XBZSP6NT","json":"https://pith.science/pith/AD4JL2LOB4JOYQCB65XBZSP6NT.json","graph_json":"https://pith.science/api/pith-number/AD4JL2LOB4JOYQCB65XBZSP6NT/graph.json","events_json":"https://pith.science/api/pith-number/AD4JL2LOB4JOYQCB65XBZSP6NT/events.json","paper":"https://pith.science/paper/AD4JL2LO"},"agent_actions":{"view_html":"https://pith.science/pith/AD4JL2LOB4JOYQCB65XBZSP6NT","download_json":"https://pith.science/pith/AD4JL2LOB4JOYQCB65XBZSP6NT.json","view_paper":"https://pith.science/paper/AD4JL2LO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2696&json=true","fetch_graph":"https://pith.science/api/pith-number/AD4JL2LOB4JOYQCB65XBZSP6NT/graph.json","fetch_events":"https://pith.science/api/pith-number/AD4JL2LOB4JOYQCB65XBZSP6NT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AD4JL2LOB4JOYQCB65XBZSP6NT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AD4JL2LOB4JOYQCB65XBZSP6NT/action/storage_attestation","attest_author":"https://pith.science/pith/AD4JL2LOB4JOYQCB65XBZSP6NT/action/author_attestation","sign_citation":"https://pith.science/pith/AD4JL2LOB4JOYQCB65XBZSP6NT/action/citation_signature","submit_replication":"https://pith.science/pith/AD4JL2LOB4JOYQCB65XBZSP6NT/action/replication_record"}},"created_at":"2026-05-18T04:12:55.531921+00:00","updated_at":"2026-05-18T04:12:55.531921+00:00"}