{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3BYVEFR54MXE5FV2TLYDFSJBFF","short_pith_number":"pith:3BYVEFR5","canonical_record":{"source":{"id":"1711.01370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-04T00:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"8346cee66cc9c86fa9f61e7d074bad82025ad4cb64e89ceebfcbbf59c1ea552f","abstract_canon_sha256":"c6723b7be2aa8e84356d5299e81f3fceaf09f0b79206e10ed701f47939de21de"},"schema_version":"1.0"},"canonical_sha256":"d87152163de32e4e96ba9af032c921296b5e59f56ae74da557e9dd0792cb23e8","source":{"kind":"arxiv","id":"1711.01370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01370","created_at":"2026-05-18T00:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01370v1","created_at":"2026-05-18T00:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01370","created_at":"2026-05-18T00:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"3BYVEFR54MXE","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3BYVEFR54MXE5FV2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3BYVEFR5","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3BYVEFR54MXE5FV2TLYDFSJBFF","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-04T00:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"8346cee66cc9c86fa9f61e7d074bad82025ad4cb64e89ceebfcbbf59c1ea552f","abstract_canon_sha256":"c6723b7be2aa8e84356d5299e81f3fceaf09f0b79206e10ed701f47939de21de"},"schema_version":"1.0"},"canonical_sha256":"d87152163de32e4e96ba9af032c921296b5e59f56ae74da557e9dd0792cb23e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:18.037789Z","signature_b64":"6bRI7vTGn5djr95FsDl3g/nF7mXHON5wFWj8WiWN4FbY34pGe8zFzUCn15GGDxu/Kbgz4J+n+EnAWfCnCI/KAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d87152163de32e4e96ba9af032c921296b5e59f56ae74da557e9dd0792cb23e8","last_reissued_at":"2026-05-18T00:31:18.037211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:18.037211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01370","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:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ym71BmFq7S7TL5JzwlTwOBA7npYaFtcJWlm1eZqX9tjZa3h+elW5gxans/tihhCD6J2AKpa5/12LLiTSP/eCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:22:41.895014Z"},"content_sha256":"12b19b929efdb01375977adca88edb3a3c583e05045ec3b1b38f8e4308748afe","schema_version":"1.0","event_id":"sha256:12b19b929efdb01375977adca88edb3a3c583e05045ec3b1b38f8e4308748afe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3BYVEFR54MXE5FV2TLYDFSJBFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On constant multi-commodity flow-cut gaps for directed minor-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Ario Salmasi, Vijay Sridhar","submitted_at":"2017-11-04T00:38:57Z","abstract_excerpt":"The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \\& conquer algorithms, and has been extensively studied for various classes of undirected graphs. It has been shown by Linial, London and Rabinovich \\cite{linial1994geometry} and by Aumann and Rabani \\cite{aumann1998log} that for general $n$-vertex graphs it is bounded by $O(\\log n)$ and the Gupta-Newman-Rabinovich-Sinclair conjecture \\cite{gupta2004cuts} asserts that it is $O(1)$ for any family of graphs that excludes some fixed minor.\n  The flow-cut gap is poorly understood for the case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01370","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:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpSf/Fg8xyVAY7Ln5qulyDpi+kUySj0JkerI+CenTBsfF3KaFL81vxEymTCfuYqXKcPlkWzBf5EQIzvz8kPzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:22:41.895747Z"},"content_sha256":"87a548a72d6ca547c6836ccbce473ba48b385957905a43b545042f80f5efd41b","schema_version":"1.0","event_id":"sha256:87a548a72d6ca547c6836ccbce473ba48b385957905a43b545042f80f5efd41b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF/bundle.json","state_url":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BYVEFR54MXE5FV2TLYDFSJBFF/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-09T19:22:41Z","links":{"resolver":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF","bundle":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF/bundle.json","state":"https://pith.science/pith/3BYVEFR54MXE5FV2TLYDFSJBFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BYVEFR54MXE5FV2TLYDFSJBFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3BYVEFR54MXE5FV2TLYDFSJBFF","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":"c6723b7be2aa8e84356d5299e81f3fceaf09f0b79206e10ed701f47939de21de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-04T00:38:57Z","title_canon_sha256":"8346cee66cc9c86fa9f61e7d074bad82025ad4cb64e89ceebfcbbf59c1ea552f"},"schema_version":"1.0","source":{"id":"1711.01370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01370","created_at":"2026-05-18T00:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01370v1","created_at":"2026-05-18T00:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01370","created_at":"2026-05-18T00:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"3BYVEFR54MXE","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3BYVEFR54MXE5FV2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3BYVEFR5","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:87a548a72d6ca547c6836ccbce473ba48b385957905a43b545042f80f5efd41b","target":"graph","created_at":"2026-05-18T00:31:18Z","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":"The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \\& conquer algorithms, and has been extensively studied for various classes of undirected graphs. It has been shown by Linial, London and Rabinovich \\cite{linial1994geometry} and by Aumann and Rabani \\cite{aumann1998log} that for general $n$-vertex graphs it is bounded by $O(\\log n)$ and the Gupta-Newman-Rabinovich-Sinclair conjecture \\cite{gupta2004cuts} asserts that it is $O(1)$ for any family of graphs that excludes some fixed minor.\n  The flow-cut gap is poorly understood for the case","authors_text":"Anastasios Sidiropoulos, Ario Salmasi, Vijay Sridhar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-04T00:38:57Z","title":"On constant multi-commodity flow-cut gaps for directed minor-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01370","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:12b19b929efdb01375977adca88edb3a3c583e05045ec3b1b38f8e4308748afe","target":"record","created_at":"2026-05-18T00:31:18Z","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":"c6723b7be2aa8e84356d5299e81f3fceaf09f0b79206e10ed701f47939de21de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-04T00:38:57Z","title_canon_sha256":"8346cee66cc9c86fa9f61e7d074bad82025ad4cb64e89ceebfcbbf59c1ea552f"},"schema_version":"1.0","source":{"id":"1711.01370","kind":"arxiv","version":1}},"canonical_sha256":"d87152163de32e4e96ba9af032c921296b5e59f56ae74da557e9dd0792cb23e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d87152163de32e4e96ba9af032c921296b5e59f56ae74da557e9dd0792cb23e8","first_computed_at":"2026-05-18T00:31:18.037211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:18.037211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6bRI7vTGn5djr95FsDl3g/nF7mXHON5wFWj8WiWN4FbY34pGe8zFzUCn15GGDxu/Kbgz4J+n+EnAWfCnCI/KAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:18.037789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12b19b929efdb01375977adca88edb3a3c583e05045ec3b1b38f8e4308748afe","sha256:87a548a72d6ca547c6836ccbce473ba48b385957905a43b545042f80f5efd41b"],"state_sha256":"034a7e3cb824facb0b95775961e8e03830896da5ebf7dc796728c04df80385ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITyBBTZRubdJLBRNtIiKgDgi1fpA85NNDcMZP8YBhsispIGSF/Bn84LpIlBcqMc6FaRU+285fBgqbPOHHLKlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:22:41.901282Z","bundle_sha256":"efc82e09c10aacbe01363177539ba69214a6f866c1be01f8807a8dfeec3cc843"}}