{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LLSV6SRTQHYDUQY3ADLEKENSEC","short_pith_number":"pith:LLSV6SRT","canonical_record":{"source":{"id":"1611.02842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-09T08:12:30Z","cross_cats_sorted":[],"title_canon_sha256":"7b17b65b79957081bebae49dead8239f92223efe614329333dba2e9c5e457846","abstract_canon_sha256":"b9cf545b432c15a7c5098221a2c98c7acc193ac5b383fc37aafd74b953277c1e"},"schema_version":"1.0"},"canonical_sha256":"5ae55f4a3381f03a431b00d64511b220b1609b2449614f27bea1630c81f796dd","source":{"kind":"arxiv","id":"1611.02842","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02842","created_at":"2026-05-18T00:59:43Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02842v1","created_at":"2026-05-18T00:59:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02842","created_at":"2026-05-18T00:59:43Z"},{"alias_kind":"pith_short_12","alias_value":"LLSV6SRTQHYD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLSV6SRTQHYDUQY3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLSV6SRT","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LLSV6SRTQHYDUQY3ADLEKENSEC","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-09T08:12:30Z","cross_cats_sorted":[],"title_canon_sha256":"7b17b65b79957081bebae49dead8239f92223efe614329333dba2e9c5e457846","abstract_canon_sha256":"b9cf545b432c15a7c5098221a2c98c7acc193ac5b383fc37aafd74b953277c1e"},"schema_version":"1.0"},"canonical_sha256":"5ae55f4a3381f03a431b00d64511b220b1609b2449614f27bea1630c81f796dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:43.453212Z","signature_b64":"69i84oDojicmrlnJlgGPi7wvqi28xzpp6SAm2MGtZGn3+FqDp6SCQIwpvVrn9c7Z+DotJ+oRxAUxfZ0murJrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ae55f4a3381f03a431b00d64511b220b1609b2449614f27bea1630c81f796dd","last_reissued_at":"2026-05-18T00:59:43.452396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:43.452396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02842","source_version":1,"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-18T00:59:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nVRO+34P1j8b+l9QTCYSZXONKS+bk9R6FiRQjUvXjkLqYxt/O/lH4goo98O7qfb+uhh9N7ZV5QZWErZ6t+9UDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:15:14.811253Z"},"content_sha256":"4b4e5e7334a6f7f4e6f7bd1b85bd2daff466ba118b87d0433fadbfd921a8aaf7","schema_version":"1.0","event_id":"sha256:4b4e5e7334a6f7f4e6f7bd1b85bd2daff466ba118b87d0433fadbfd921a8aaf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LLSV6SRTQHYDUQY3ADLEKENSEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Policy-Compliant Path Diversity and Bisection Bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bernhard Ager, Rowan Kloti, Vasileios Kotronis, Xenofontas Dimitropoulos","submitted_at":"2016-11-09T08:12:30Z","abstract_excerpt":"How many links can be cut before a network is bisected? What is the maximal bandwidth that can be pushed between two nodes of a network? These questions are closely related to network resilience, path choice for multipath routing or bisection bandwidth estimations in data centers. The answer is quantified using metrics such as the number of edge-disjoint paths between two network nodes and the cumulative bandwidth that can flow over these paths. In practice though, such calculations are far from simple due to the restrictive effect of network policies on path selection. Policies are set by net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02842","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":""},"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-18T00:59:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8G7IvKLl4N4a/kKI9+r+4+3Qr45iB4BoMqXxajqf+e7zRXHcXbnwDQjwkn9LEhS2SdhUcqhk6ibwlXaaWatVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:15:14.811889Z"},"content_sha256":"180d7e89c38bede18c0c302770478b93a81df730c088bf53ffdd048cadeb8062","schema_version":"1.0","event_id":"sha256:180d7e89c38bede18c0c302770478b93a81df730c088bf53ffdd048cadeb8062"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLSV6SRTQHYDUQY3ADLEKENSEC/bundle.json","state_url":"https://pith.science/pith/LLSV6SRTQHYDUQY3ADLEKENSEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLSV6SRTQHYDUQY3ADLEKENSEC/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-06-07T14:15:14Z","links":{"resolver":"https://pith.science/pith/LLSV6SRTQHYDUQY3ADLEKENSEC","bundle":"https://pith.science/pith/LLSV6SRTQHYDUQY3ADLEKENSEC/bundle.json","state":"https://pith.science/pith/LLSV6SRTQHYDUQY3ADLEKENSEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLSV6SRTQHYDUQY3ADLEKENSEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LLSV6SRTQHYDUQY3ADLEKENSEC","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":"b9cf545b432c15a7c5098221a2c98c7acc193ac5b383fc37aafd74b953277c1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-09T08:12:30Z","title_canon_sha256":"7b17b65b79957081bebae49dead8239f92223efe614329333dba2e9c5e457846"},"schema_version":"1.0","source":{"id":"1611.02842","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02842","created_at":"2026-05-18T00:59:43Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02842v1","created_at":"2026-05-18T00:59:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02842","created_at":"2026-05-18T00:59:43Z"},{"alias_kind":"pith_short_12","alias_value":"LLSV6SRTQHYD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLSV6SRTQHYDUQY3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLSV6SRT","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:180d7e89c38bede18c0c302770478b93a81df730c088bf53ffdd048cadeb8062","target":"graph","created_at":"2026-05-18T00:59:43Z","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":"How many links can be cut before a network is bisected? What is the maximal bandwidth that can be pushed between two nodes of a network? These questions are closely related to network resilience, path choice for multipath routing or bisection bandwidth estimations in data centers. The answer is quantified using metrics such as the number of edge-disjoint paths between two network nodes and the cumulative bandwidth that can flow over these paths. In practice though, such calculations are far from simple due to the restrictive effect of network policies on path selection. Policies are set by net","authors_text":"Bernhard Ager, Rowan Kloti, Vasileios Kotronis, Xenofontas Dimitropoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-09T08:12:30Z","title":"Policy-Compliant Path Diversity and Bisection Bandwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02842","kind":"arxiv","version":1},"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:4b4e5e7334a6f7f4e6f7bd1b85bd2daff466ba118b87d0433fadbfd921a8aaf7","target":"record","created_at":"2026-05-18T00:59:43Z","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":"b9cf545b432c15a7c5098221a2c98c7acc193ac5b383fc37aafd74b953277c1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-09T08:12:30Z","title_canon_sha256":"7b17b65b79957081bebae49dead8239f92223efe614329333dba2e9c5e457846"},"schema_version":"1.0","source":{"id":"1611.02842","kind":"arxiv","version":1}},"canonical_sha256":"5ae55f4a3381f03a431b00d64511b220b1609b2449614f27bea1630c81f796dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ae55f4a3381f03a431b00d64511b220b1609b2449614f27bea1630c81f796dd","first_computed_at":"2026-05-18T00:59:43.452396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:43.452396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"69i84oDojicmrlnJlgGPi7wvqi28xzpp6SAm2MGtZGn3+FqDp6SCQIwpvVrn9c7Z+DotJ+oRxAUxfZ0murJrBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:43.453212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02842","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b4e5e7334a6f7f4e6f7bd1b85bd2daff466ba118b87d0433fadbfd921a8aaf7","sha256:180d7e89c38bede18c0c302770478b93a81df730c088bf53ffdd048cadeb8062"],"state_sha256":"dd4d85d87eb3772081ce4da5417a60056e2400d44c1ddd190a8d3c032092cd3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qqlURRNbZRS+jHQpZd6iEHLqsENmcUUy7hazhwYo8ooR7noCgdq9hOhOhgk6CaiKm9nKXjQ6YTu5xyx27VgyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:15:14.815675Z","bundle_sha256":"2780a705e9e11c06ec89bfae2b4f692378ac8ce73ef8bf111a84aed4390938ca"}}