{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NAFNIDFXBSRGOYDG42OIW7VYTY","short_pith_number":"pith:NAFNIDFX","canonical_record":{"source":{"id":"1507.02799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-10T08:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"6c474e1420436709d1382dd94470fb71db5038aa22f9a893cef16799942bd143","abstract_canon_sha256":"690ef3c648438260182b9df9c9ffdc91c4c0f552c231c2f983b2786d0189ab4c"},"schema_version":"1.0"},"canonical_sha256":"680ad40cb70ca2676066e69c8b7eb89e07929238e0956e94bcf18b4159ee1197","source":{"kind":"arxiv","id":"1507.02799","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02799","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02799v1","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02799","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"NAFNIDFXBSRG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NAFNIDFXBSRGOYDG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NAFNIDFX","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NAFNIDFXBSRGOYDG42OIW7VYTY","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-10T08:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"6c474e1420436709d1382dd94470fb71db5038aa22f9a893cef16799942bd143","abstract_canon_sha256":"690ef3c648438260182b9df9c9ffdc91c4c0f552c231c2f983b2786d0189ab4c"},"schema_version":"1.0"},"canonical_sha256":"680ad40cb70ca2676066e69c8b7eb89e07929238e0956e94bcf18b4159ee1197","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:03.187837Z","signature_b64":"O66cGj3UT56tK3snyrPvylRw5GTcg3gFlGHLj+yXkZXFsCHoFPhOPQEnhxIp2e+wzMmqymrd0q23VHgqF18xAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"680ad40cb70ca2676066e69c8b7eb89e07929238e0956e94bcf18b4159ee1197","last_reissued_at":"2026-05-18T01:37:03.187270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:03.187270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02799","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-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ETh7TA7+J9kEZtcfKJO2FdupJP+qoBXejtswph/L5Xa0191m1pxra/+DZfLDwBl1UdPndwwD7cio7v3oK56RBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:38:58.564673Z"},"content_sha256":"141a9610ff4a2f7316b9dfbcda965f962db8e13515028df05cbf4090bba65f94","schema_version":"1.0","event_id":"sha256:141a9610ff4a2f7316b9dfbcda965f962db8e13515028df05cbf4090bba65f94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NAFNIDFXBSRGOYDG42OIW7VYTY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Zeev Nutov","submitted_at":"2015-07-10T08:10:40Z","abstract_excerpt":"The Tree Augmentation Problem (TAP) is: given a connected graph $G=(V,{\\cal E})$ and an edge set $E$ on $V$ find a minimum size subset of edges $F \\subseteq E$ such that $(V,{\\cal E} \\cup F)$ is $2$-edge-connected. In the conference version \\cite{EFKN-APPROX} was sketched a $1.5$-approximation algorithm for the problem. Since a full proof was very complex and long, the journal version was cut into two parts. In the first part \\cite{EFKN-TALG} was only proved ratio $1.8$. An attempt to simplify the second part produced an error in \\cite{EKN-IPL}. Here we give a correct, different, and self cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02799","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-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNjGyRPvGNnVTUF1iU/5Nr8PxjakU978Cpks3rwLmMNf+CeVsuZ3s8eJPfMXB9w57NIxTmT6KqdF4nD0/aieAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:38:58.565192Z"},"content_sha256":"e0b04a639594777cbaacb13a5cf333b385fc280428daf236a44212af91953539","schema_version":"1.0","event_id":"sha256:e0b04a639594777cbaacb13a5cf333b385fc280428daf236a44212af91953539"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY/bundle.json","state_url":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NAFNIDFXBSRGOYDG42OIW7VYTY/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-26T03:38:58Z","links":{"resolver":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY","bundle":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY/bundle.json","state":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NAFNIDFXBSRGOYDG42OIW7VYTY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NAFNIDFXBSRGOYDG42OIW7VYTY","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":"690ef3c648438260182b9df9c9ffdc91c4c0f552c231c2f983b2786d0189ab4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-10T08:10:40Z","title_canon_sha256":"6c474e1420436709d1382dd94470fb71db5038aa22f9a893cef16799942bd143"},"schema_version":"1.0","source":{"id":"1507.02799","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02799","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02799v1","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02799","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"NAFNIDFXBSRG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NAFNIDFXBSRGOYDG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NAFNIDFX","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:e0b04a639594777cbaacb13a5cf333b385fc280428daf236a44212af91953539","target":"graph","created_at":"2026-05-18T01:37:03Z","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 Tree Augmentation Problem (TAP) is: given a connected graph $G=(V,{\\cal E})$ and an edge set $E$ on $V$ find a minimum size subset of edges $F \\subseteq E$ such that $(V,{\\cal E} \\cup F)$ is $2$-edge-connected. In the conference version \\cite{EFKN-APPROX} was sketched a $1.5$-approximation algorithm for the problem. Since a full proof was very complex and long, the journal version was cut into two parts. In the first part \\cite{EFKN-TALG} was only proved ratio $1.8$. An attempt to simplify the second part produced an error in \\cite{EKN-IPL}. Here we give a correct, different, and self cont","authors_text":"Guy Kortsarz, Zeev Nutov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-10T08:10:40Z","title":"A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02799","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:141a9610ff4a2f7316b9dfbcda965f962db8e13515028df05cbf4090bba65f94","target":"record","created_at":"2026-05-18T01:37:03Z","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":"690ef3c648438260182b9df9c9ffdc91c4c0f552c231c2f983b2786d0189ab4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-10T08:10:40Z","title_canon_sha256":"6c474e1420436709d1382dd94470fb71db5038aa22f9a893cef16799942bd143"},"schema_version":"1.0","source":{"id":"1507.02799","kind":"arxiv","version":1}},"canonical_sha256":"680ad40cb70ca2676066e69c8b7eb89e07929238e0956e94bcf18b4159ee1197","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"680ad40cb70ca2676066e69c8b7eb89e07929238e0956e94bcf18b4159ee1197","first_computed_at":"2026-05-18T01:37:03.187270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:03.187270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O66cGj3UT56tK3snyrPvylRw5GTcg3gFlGHLj+yXkZXFsCHoFPhOPQEnhxIp2e+wzMmqymrd0q23VHgqF18xAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:03.187837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02799","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:141a9610ff4a2f7316b9dfbcda965f962db8e13515028df05cbf4090bba65f94","sha256:e0b04a639594777cbaacb13a5cf333b385fc280428daf236a44212af91953539"],"state_sha256":"baf179569b70415b00464ab53cebab390a4b5fe4c6c39243f0a18206de6e6394"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qzSdxxE1WxfEn3oXsBFAc8y851HPlxiJYYT9HRiXBR8ZSTQ/EfHbL5xX8VYrvdDxkzthpgBprVb+yII1x+mGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:38:58.569751Z","bundle_sha256":"dec742fcd0045ff93ea0be596dcc711c880e20f4bc215413a05a49c23586defe"}}