{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:U3SFLAQEPVOS7FBMQ7TCHITFAE","short_pith_number":"pith:U3SFLAQE","canonical_record":{"source":{"id":"1904.11777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T11:42:45Z","cross_cats_sorted":[],"title_canon_sha256":"5c950f1a6b0a43ab651b42689e3616d7a643263ca7070a29f513d6b4dfefd2a8","abstract_canon_sha256":"60e3a0658672133eaef17b0b42292d67234dae07e07e8629a52e15596abadd1e"},"schema_version":"1.0"},"canonical_sha256":"a6e45582047d5d2f942c87e623a265010693921849c00ec13e99b594e78449d3","source":{"kind":"arxiv","id":"1904.11777","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11777","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11777v1","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11777","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"pith_short_12","alias_value":"U3SFLAQEPVOS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U3SFLAQEPVOS7FBM","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U3SFLAQE","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:U3SFLAQEPVOS7FBMQ7TCHITFAE","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T11:42:45Z","cross_cats_sorted":[],"title_canon_sha256":"5c950f1a6b0a43ab651b42689e3616d7a643263ca7070a29f513d6b4dfefd2a8","abstract_canon_sha256":"60e3a0658672133eaef17b0b42292d67234dae07e07e8629a52e15596abadd1e"},"schema_version":"1.0"},"canonical_sha256":"a6e45582047d5d2f942c87e623a265010693921849c00ec13e99b594e78449d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:40.969813Z","signature_b64":"DM+wEZ0TiAcsDzQa+N8yjqAySA5XN+hyCUnfjOGY5OBIU2tJuQ3wlQ4iRByB+dx5kWjlWgmble3T86groLZ1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6e45582047d5d2f942c87e623a265010693921849c00ec13e99b594e78449d3","last_reissued_at":"2026-05-17T23:47:40.969163Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:40.969163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11777","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-17T23:47:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2o0V+V5NRevdvBbH+N69rOZ667vHPssp5reUCYvrVnUsTD8Tp1faQFyOfoy6EJfAVZSifBzK7pHrxXIIGxHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:22:46.411719Z"},"content_sha256":"a0fe5f3555a9e8713c2387b8effe0fd574bad1ab7f0698386df1a5378553fc6e","schema_version":"1.0","event_id":"sha256:a0fe5f3555a9e8713c2387b8effe0fd574bad1ab7f0698386df1a5378553fc6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:U3SFLAQEPVOS7FBMQ7TCHITFAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Bounds for Online Weighted Tree Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Williamson, Joseph (Seffi) Naor, Seeun William Umboh","submitted_at":"2019-04-26T11:42:45Z","abstract_excerpt":"The Weighted Tree Augmentation problem (WTAP) is a fundamental problem in network design. In this paper, we consider this problem in the online setting. We are given an $n$-vertex spanning tree $T$ and an additional set $L$ of edges (called links) with costs. Then, terminal pairs arrive one-by-one and our task is to maintain a low-cost subset of links $F$ such that every terminal pair that has arrived so far is $2$-edge-connected in $T \\cup F$. This online problem was first studied by Gupta, Krishnaswamy and Ravi (SICOMP 2012) who used it as a subroutine for the online survivable network desig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11777","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-17T23:47:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XEu6BPB8yv3GIU2TGjWJ6XBVVG6/ckIH+eaUVBivStU3XVXyV25HRcO2P5Y+248bE80tSdmjj9BFRySg2bkRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:22:46.412060Z"},"content_sha256":"90bde41a31b2ae1b866a2fdfede06ebc6c5d26ac16b2acfce232c635f4b389e4","schema_version":"1.0","event_id":"sha256:90bde41a31b2ae1b866a2fdfede06ebc6c5d26ac16b2acfce232c635f4b389e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3SFLAQEPVOS7FBMQ7TCHITFAE/bundle.json","state_url":"https://pith.science/pith/U3SFLAQEPVOS7FBMQ7TCHITFAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3SFLAQEPVOS7FBMQ7TCHITFAE/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-05-28T06:22:46Z","links":{"resolver":"https://pith.science/pith/U3SFLAQEPVOS7FBMQ7TCHITFAE","bundle":"https://pith.science/pith/U3SFLAQEPVOS7FBMQ7TCHITFAE/bundle.json","state":"https://pith.science/pith/U3SFLAQEPVOS7FBMQ7TCHITFAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3SFLAQEPVOS7FBMQ7TCHITFAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:U3SFLAQEPVOS7FBMQ7TCHITFAE","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":"60e3a0658672133eaef17b0b42292d67234dae07e07e8629a52e15596abadd1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T11:42:45Z","title_canon_sha256":"5c950f1a6b0a43ab651b42689e3616d7a643263ca7070a29f513d6b4dfefd2a8"},"schema_version":"1.0","source":{"id":"1904.11777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11777","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11777v1","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11777","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"pith_short_12","alias_value":"U3SFLAQEPVOS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U3SFLAQEPVOS7FBM","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U3SFLAQE","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:90bde41a31b2ae1b866a2fdfede06ebc6c5d26ac16b2acfce232c635f4b389e4","target":"graph","created_at":"2026-05-17T23:47:40Z","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 Weighted Tree Augmentation problem (WTAP) is a fundamental problem in network design. In this paper, we consider this problem in the online setting. We are given an $n$-vertex spanning tree $T$ and an additional set $L$ of edges (called links) with costs. Then, terminal pairs arrive one-by-one and our task is to maintain a low-cost subset of links $F$ such that every terminal pair that has arrived so far is $2$-edge-connected in $T \\cup F$. This online problem was first studied by Gupta, Krishnaswamy and Ravi (SICOMP 2012) who used it as a subroutine for the online survivable network desig","authors_text":"David P. Williamson, Joseph (Seffi) Naor, Seeun William Umboh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T11:42:45Z","title":"Tight Bounds for Online Weighted Tree Augmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11777","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:a0fe5f3555a9e8713c2387b8effe0fd574bad1ab7f0698386df1a5378553fc6e","target":"record","created_at":"2026-05-17T23:47:40Z","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":"60e3a0658672133eaef17b0b42292d67234dae07e07e8629a52e15596abadd1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T11:42:45Z","title_canon_sha256":"5c950f1a6b0a43ab651b42689e3616d7a643263ca7070a29f513d6b4dfefd2a8"},"schema_version":"1.0","source":{"id":"1904.11777","kind":"arxiv","version":1}},"canonical_sha256":"a6e45582047d5d2f942c87e623a265010693921849c00ec13e99b594e78449d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6e45582047d5d2f942c87e623a265010693921849c00ec13e99b594e78449d3","first_computed_at":"2026-05-17T23:47:40.969163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:40.969163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DM+wEZ0TiAcsDzQa+N8yjqAySA5XN+hyCUnfjOGY5OBIU2tJuQ3wlQ4iRByB+dx5kWjlWgmble3T86groLZ1AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:40.969813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0fe5f3555a9e8713c2387b8effe0fd574bad1ab7f0698386df1a5378553fc6e","sha256:90bde41a31b2ae1b866a2fdfede06ebc6c5d26ac16b2acfce232c635f4b389e4"],"state_sha256":"9f1a3b78d6e6cce80961f3fa6c68a58b1a1170fbb62b4cc969a5af9b24d3d4d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/MJkrYp6rKV7SrT5ijpUFsSAmrDpwfdxxaI3j4hFH6WOIKjUDfhN/e5wwZAE/qpI6ioqLqRs5L0leRQfLjaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:22:46.414005Z","bundle_sha256":"6b440edf4c5f7d02da60682b5a02040b54bf97a8bb5cec442436f89727d98925"}}