{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EGMM5BUTM35LZF2IRBUIUM5QMR","short_pith_number":"pith:EGMM5BUT","canonical_record":{"source":{"id":"2611.16521","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T09:17:32Z","cross_cats_sorted":[],"title_canon_sha256":"63b4b55955822e9cc457ff11fe57eaa61a4f0c08dc5d2e17e726ad15c60e68c0","abstract_canon_sha256":"4eb8b895c5f0f79155b1afeb1691c53f6fc2b27816e7e06e28418c78ff9111b8"},"schema_version":"1.0"},"canonical_sha256":"2198ce869366fabc974888688a33b064436579c10479d942bc780183a8f1eef6","source":{"kind":"arxiv","id":"2611.16521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2611.16521","created_at":"2026-11-13T05:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"2611.16521v1","created_at":"2026-11-13T05:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2611.16521","created_at":"2026-11-13T05:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"EGMM5BUTM35L","created_at":"2026-11-13T05:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"EGMM5BUTM35LZF2I","created_at":"2026-11-13T05:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"EGMM5BUT","created_at":"2026-11-13T05:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EGMM5BUTM35LZF2IRBUIUM5QMR","target":"record","payload":{"canonical_record":{"source":{"id":"2611.16521","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T09:17:32Z","cross_cats_sorted":[],"title_canon_sha256":"63b4b55955822e9cc457ff11fe57eaa61a4f0c08dc5d2e17e726ad15c60e68c0","abstract_canon_sha256":"4eb8b895c5f0f79155b1afeb1691c53f6fc2b27816e7e06e28418c78ff9111b8"},"schema_version":"1.0"},"canonical_sha256":"2198ce869366fabc974888688a33b064436579c10479d942bc780183a8f1eef6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-11-13T05:32:16.732062Z","signature_b64":"mflkkHee+7CB5rwlLxhBHfzl/E+sVXeOC8mKf3qwsjEB5t1mfYQBmBeX23M4OJCt0UwGOE5TSvGaeWjoxijSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2198ce869366fabc974888688a33b064436579c10479d942bc780183a8f1eef6","last_reissued_at":"2026-11-13T05:32:16.729536Z","signature_status":"signed_v1","first_computed_at":"2026-11-13T05:32:16.729536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2611.16521","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-11-13T05:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1H5uuT2FP4cEp0m3kU9yJRgrgWiHCWDfrdOnCz2VmXDiVMtwd3mFEK6EOGenO7myRbygeAZvIKKVe02Q1CgwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T06:12:53.774854Z"},"content_sha256":"fb60b1bb6b923526efaf8c3a5534efbf8ade024cf408a14982e35034f9690128","schema_version":"1.0","event_id":"sha256:fb60b1bb6b923526efaf8c3a5534efbf8ade024cf408a14982e35034f9690128"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EGMM5BUTM35LZF2IRBUIUM5QMR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Survivable Network Design with Arbitrarily Small Connectivity Loss","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"MohammadTaghi Hajiaghayi, Saeed Seddighin","submitted_at":"2026-11-12T09:17:32Z","abstract_excerpt":"In the online survivable network design problem, a graph with edge costs is known in advance, and requests arrive one at a time. Each request is a pair of vertices $(s,t)$ with a connectivity requirement $k$, and the algorithm must irrevocably buy edges so that $s$ and $t$ are joined by $k$ edge-disjoint paths. The goal is to keep the total cost close to that of an optimal offline solution.\n  Gupta, Krishnaswamy, and Ravi~\\cite{GKR12} obtain an $O(k\\log^3 n)$-competitive algorithm, where $k$ is the maximum requirement, without relaxing the connectivity requirement. Dehghani, Ehsani, Hajiaghayi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2611.16521","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/2611.16521/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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-11-13T05:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hN6XpZGa4oogK45bq32I62CiNCV28IjOBiIqXiXB7yH5PBhOGRNnvag97JoJ5ltQ581H8CjEOH/IxE5zopWiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T06:12:53.775205Z"},"content_sha256":"bdcfa0ebd1ee3f9bd1d3edb1411f248015419beb050bd64e5f3f3b8799e79056","schema_version":"1.0","event_id":"sha256:bdcfa0ebd1ee3f9bd1d3edb1411f248015419beb050bd64e5f3f3b8799e79056"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGMM5BUTM35LZF2IRBUIUM5QMR/bundle.json","state_url":"https://pith.science/pith/EGMM5BUTM35LZF2IRBUIUM5QMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGMM5BUTM35LZF2IRBUIUM5QMR/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-11-16T06:12:53Z","links":{"resolver":"https://pith.science/pith/EGMM5BUTM35LZF2IRBUIUM5QMR","bundle":"https://pith.science/pith/EGMM5BUTM35LZF2IRBUIUM5QMR/bundle.json","state":"https://pith.science/pith/EGMM5BUTM35LZF2IRBUIUM5QMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGMM5BUTM35LZF2IRBUIUM5QMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EGMM5BUTM35LZF2IRBUIUM5QMR","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":"4eb8b895c5f0f79155b1afeb1691c53f6fc2b27816e7e06e28418c78ff9111b8","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T09:17:32Z","title_canon_sha256":"63b4b55955822e9cc457ff11fe57eaa61a4f0c08dc5d2e17e726ad15c60e68c0"},"schema_version":"1.0","source":{"id":"2611.16521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2611.16521","created_at":"2026-11-13T05:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"2611.16521v1","created_at":"2026-11-13T05:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2611.16521","created_at":"2026-11-13T05:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"EGMM5BUTM35L","created_at":"2026-11-13T05:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"EGMM5BUTM35LZF2I","created_at":"2026-11-13T05:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"EGMM5BUT","created_at":"2026-11-13T05:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:bdcfa0ebd1ee3f9bd1d3edb1411f248015419beb050bd64e5f3f3b8799e79056","target":"graph","created_at":"2026-11-13T05:32:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2611.16521/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the online survivable network design problem, a graph with edge costs is known in advance, and requests arrive one at a time. Each request is a pair of vertices $(s,t)$ with a connectivity requirement $k$, and the algorithm must irrevocably buy edges so that $s$ and $t$ are joined by $k$ edge-disjoint paths. The goal is to keep the total cost close to that of an optimal offline solution.\n  Gupta, Krishnaswamy, and Ravi~\\cite{GKR12} obtain an $O(k\\log^3 n)$-competitive algorithm, where $k$ is the maximum requirement, without relaxing the connectivity requirement. Dehghani, Ehsani, Hajiaghayi","authors_text":"MohammadTaghi Hajiaghayi, Saeed Seddighin","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T09:17:32Z","title":"Online Survivable Network Design with Arbitrarily Small Connectivity Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2611.16521","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:fb60b1bb6b923526efaf8c3a5534efbf8ade024cf408a14982e35034f9690128","target":"record","created_at":"2026-11-13T05:32:16Z","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":"4eb8b895c5f0f79155b1afeb1691c53f6fc2b27816e7e06e28418c78ff9111b8","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T09:17:32Z","title_canon_sha256":"63b4b55955822e9cc457ff11fe57eaa61a4f0c08dc5d2e17e726ad15c60e68c0"},"schema_version":"1.0","source":{"id":"2611.16521","kind":"arxiv","version":1}},"canonical_sha256":"2198ce869366fabc974888688a33b064436579c10479d942bc780183a8f1eef6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2198ce869366fabc974888688a33b064436579c10479d942bc780183a8f1eef6","first_computed_at":"2026-11-13T05:32:16.729536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-11-13T05:32:16.729536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mflkkHee+7CB5rwlLxhBHfzl/E+sVXeOC8mKf3qwsjEB5t1mfYQBmBeX23M4OJCt0UwGOE5TSvGaeWjoxijSAg==","signature_status":"signed_v1","signed_at":"2026-11-13T05:32:16.732062Z","signed_message":"canonical_sha256_bytes"},"source_id":"2611.16521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb60b1bb6b923526efaf8c3a5534efbf8ade024cf408a14982e35034f9690128","sha256:bdcfa0ebd1ee3f9bd1d3edb1411f248015419beb050bd64e5f3f3b8799e79056"],"state_sha256":"fe7a286dead73eeecb48cd76d4bd7d0ffe21d724b1a48a41fb7a01784ba3e22e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPf43kYp1KunFPW72meUZn/iWXh/egmQQRymD4pz0DtapaIDn2n+pCMwVP9a/OX3H1phOcJIE/JVUep51as6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-11-16T06:12:53.779680Z","bundle_sha256":"2cd644372bfc84302bf8515d6486d92c51a490fd1f3fefd9fea28cb72bc8e219"}}