{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:36N7MXFKLMHBXHPZBFVPZIAAT3","short_pith_number":"pith:36N7MXFK","canonical_record":{"source":{"id":"1707.05240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T15:42:38Z","cross_cats_sorted":[],"title_canon_sha256":"ffc1dae56927daf82d41284f722c1b199baf7b3dfdadac068a07f3bd94402b1d","abstract_canon_sha256":"98389da542b095ec93143efd68e684dd4c3d1eea7c9b738522e3b86cf2537c9e"},"schema_version":"1.0"},"canonical_sha256":"df9bf65caa5b0e1b9df9096afca0009ec4a872821d8a3efbf9441002f7b46747","source":{"kind":"arxiv","id":"1707.05240","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05240","created_at":"2026-05-18T00:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05240v1","created_at":"2026-05-18T00:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05240","created_at":"2026-05-18T00:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"36N7MXFKLMHB","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"36N7MXFKLMHBXHPZ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"36N7MXFK","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:36N7MXFKLMHBXHPZBFVPZIAAT3","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T15:42:38Z","cross_cats_sorted":[],"title_canon_sha256":"ffc1dae56927daf82d41284f722c1b199baf7b3dfdadac068a07f3bd94402b1d","abstract_canon_sha256":"98389da542b095ec93143efd68e684dd4c3d1eea7c9b738522e3b86cf2537c9e"},"schema_version":"1.0"},"canonical_sha256":"df9bf65caa5b0e1b9df9096afca0009ec4a872821d8a3efbf9441002f7b46747","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:09.097716Z","signature_b64":"D011282Br2723wtrSX9JIfPLJxIzwfArGmnepT0wlEqtg0+tj7j+gy5iCaIOSkd1xB5+uQGVxbSSg/tWqFEBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df9bf65caa5b0e1b9df9096afca0009ec4a872821d8a3efbf9441002f7b46747","last_reissued_at":"2026-05-18T00:40:09.097068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:09.097068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05240","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:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IjJ4HhoLqFIjCRGDV4p+/BOvZtG4oqK/qv5USxKEgI2LzPYyeBVduRt8GUdWP9Fv2JvAkFdHkNE3vmCxX5toCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:20:01.083413Z"},"content_sha256":"47b7a6111ec0ac9fd7f6c2e86e1558609ed3afd9fb55592e036212c402c11a16","schema_version":"1.0","event_id":"sha256:47b7a6111ec0ac9fd7f6c2e86e1558609ed3afd9fb55592e036212c402c11a16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:36N7MXFKLMHBXHPZBFVPZIAAT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coloring Down: $3/2$-approximation for special cases of the weighted tree augmentation problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jennifer Iglesias, R. Ravi","submitted_at":"2017-07-17T15:42:38Z","abstract_excerpt":"In this paper, we investigate the weighted tree augmentation problem (TAP), where the goal is to augment a tree with a minimum cost set of edges such that the graph becomes two edge connected. First we show that in weighted TAP, we can restrict our attention to trees which are binary and where all the non-tree edges go between two leaves of the tree. We then give two different top-down coloring algorithms. Both algorithms differ from known techniques for a 3/2-approximation in unweighted TAP and current attempts to reach a 3/2-approximation for weighted TAP.\n  The first algorithm we describe a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05240","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:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cexCUocDH4SfdySSALu02XrXjbKawRrlL8q1lirrYkjG9l4Wy1Es/OOhXWULbZkt0maTSTiIs4XBYZTxZzBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:20:01.083764Z"},"content_sha256":"429265a5813f5665673c0b75201dc6fe345a39adb1639a0baea265f564c118ed","schema_version":"1.0","event_id":"sha256:429265a5813f5665673c0b75201dc6fe345a39adb1639a0baea265f564c118ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36N7MXFKLMHBXHPZBFVPZIAAT3/bundle.json","state_url":"https://pith.science/pith/36N7MXFKLMHBXHPZBFVPZIAAT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36N7MXFKLMHBXHPZBFVPZIAAT3/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:20:01Z","links":{"resolver":"https://pith.science/pith/36N7MXFKLMHBXHPZBFVPZIAAT3","bundle":"https://pith.science/pith/36N7MXFKLMHBXHPZBFVPZIAAT3/bundle.json","state":"https://pith.science/pith/36N7MXFKLMHBXHPZBFVPZIAAT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36N7MXFKLMHBXHPZBFVPZIAAT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:36N7MXFKLMHBXHPZBFVPZIAAT3","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":"98389da542b095ec93143efd68e684dd4c3d1eea7c9b738522e3b86cf2537c9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T15:42:38Z","title_canon_sha256":"ffc1dae56927daf82d41284f722c1b199baf7b3dfdadac068a07f3bd94402b1d"},"schema_version":"1.0","source":{"id":"1707.05240","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05240","created_at":"2026-05-18T00:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05240v1","created_at":"2026-05-18T00:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05240","created_at":"2026-05-18T00:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"36N7MXFKLMHB","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"36N7MXFKLMHBXHPZ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"36N7MXFK","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:429265a5813f5665673c0b75201dc6fe345a39adb1639a0baea265f564c118ed","target":"graph","created_at":"2026-05-18T00:40:09Z","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":"In this paper, we investigate the weighted tree augmentation problem (TAP), where the goal is to augment a tree with a minimum cost set of edges such that the graph becomes two edge connected. First we show that in weighted TAP, we can restrict our attention to trees which are binary and where all the non-tree edges go between two leaves of the tree. We then give two different top-down coloring algorithms. Both algorithms differ from known techniques for a 3/2-approximation in unweighted TAP and current attempts to reach a 3/2-approximation for weighted TAP.\n  The first algorithm we describe a","authors_text":"Jennifer Iglesias, R. Ravi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T15:42:38Z","title":"Coloring Down: $3/2$-approximation for special cases of the weighted tree augmentation problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05240","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:47b7a6111ec0ac9fd7f6c2e86e1558609ed3afd9fb55592e036212c402c11a16","target":"record","created_at":"2026-05-18T00:40:09Z","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":"98389da542b095ec93143efd68e684dd4c3d1eea7c9b738522e3b86cf2537c9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T15:42:38Z","title_canon_sha256":"ffc1dae56927daf82d41284f722c1b199baf7b3dfdadac068a07f3bd94402b1d"},"schema_version":"1.0","source":{"id":"1707.05240","kind":"arxiv","version":1}},"canonical_sha256":"df9bf65caa5b0e1b9df9096afca0009ec4a872821d8a3efbf9441002f7b46747","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df9bf65caa5b0e1b9df9096afca0009ec4a872821d8a3efbf9441002f7b46747","first_computed_at":"2026-05-18T00:40:09.097068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:09.097068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D011282Br2723wtrSX9JIfPLJxIzwfArGmnepT0wlEqtg0+tj7j+gy5iCaIOSkd1xB5+uQGVxbSSg/tWqFEBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:09.097716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05240","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47b7a6111ec0ac9fd7f6c2e86e1558609ed3afd9fb55592e036212c402c11a16","sha256:429265a5813f5665673c0b75201dc6fe345a39adb1639a0baea265f564c118ed"],"state_sha256":"89fd1559bd27f08385d1de87d278a2a0d2cdbb81034161276d8e6db40efede38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYsL/glVHoOx7hJp+Xcavx6FsiWiqGRqapNQmCUUWZclBmNHRcqr22a5MVL8j7kKH7p2/MHAohMxjoTez0gFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:20:01.085797Z","bundle_sha256":"9498a5d51440fc8c697fb36f3971d66cdc1d552c5960fcaa3bfb808c5af54bff"}}