{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NESA4VTT24QZKTPZD4L3UKTJHP","short_pith_number":"pith:NESA4VTT","canonical_record":{"source":{"id":"1207.5722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T15:20:22Z","cross_cats_sorted":[],"title_canon_sha256":"bf5edd5c911311daf55e66c800b03e93c900e4fe8a87d45143fdea56447a51e1","abstract_canon_sha256":"015a77ab3185e3194ea06e061579dd1b618ce13f8666ca1d1210b02a85a05fcd"},"schema_version":"1.0"},"canonical_sha256":"69240e5673d721954df91f17ba2a693bf1715c815a93606583aaa2fb33e78d24","source":{"kind":"arxiv","id":"1207.5722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5722","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5722v1","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5722","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"NESA4VTT24QZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NESA4VTT24QZKTPZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NESA4VTT","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NESA4VTT24QZKTPZD4L3UKTJHP","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T15:20:22Z","cross_cats_sorted":[],"title_canon_sha256":"bf5edd5c911311daf55e66c800b03e93c900e4fe8a87d45143fdea56447a51e1","abstract_canon_sha256":"015a77ab3185e3194ea06e061579dd1b618ce13f8666ca1d1210b02a85a05fcd"},"schema_version":"1.0"},"canonical_sha256":"69240e5673d721954df91f17ba2a693bf1715c815a93606583aaa2fb33e78d24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:11.507445Z","signature_b64":"WtBLJbf6mcHHdx31+uUHCeoQNIygdiBg1WUC/Y9YVQlI53qBlusRV39o/KuW2Kzp9TaGgZXPagjuhCkA5NwZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69240e5673d721954df91f17ba2a693bf1715c815a93606583aaa2fb33e78d24","last_reissued_at":"2026-05-18T03:50:11.506574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:11.506574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5722","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-18T03:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hew5btWNzWQ7svFNLrBqo4CJe/B2ePmllj57+17abI/7MmHVv1axlYtNWEHN0i0jg9+xCymUlrtIvr3g8l8hDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:05:03.691133Z"},"content_sha256":"95c2dd56fd7d7210d1fc44d65b1ddd333889b57b1d8a2df9436a957a807b6160","schema_version":"1.0","event_id":"sha256:95c2dd56fd7d7210d1fc44d65b1ddd333889b57b1d8a2df9436a957a807b6160"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NESA4VTT24QZKTPZD4L3UKTJHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Minimum-Cost Connected T-Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joseph Cheriyan, Zachary Friggstad, Zhihan Gao","submitted_at":"2012-07-24T15:20:22Z","abstract_excerpt":"We design and analyse approximation algorithms for the minimum-cost connected T-join problem: given an undirected graph G = (V;E) with nonnegative costs on the edges, and a subset of nodes T, find (if it exists) a spanning connected subgraph H of minimum cost such that every node in T has odd degree and every node not in T has even degree; H may have multiple copies of any edge of G. Two well-known special cases are the TSP (|T| = 0) and the s-t path TSP (|T| = 2). Recently, An, Kleinberg, and Shmoys [STOC 2012] improved on the long-standing 5/3-approximation guarantee for the latter problem a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5722","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-18T03:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m4WiCmo+MBkwGH9Jhzp98Uu1kfgNJhoejyDgDdlutyPqflN8Zn6KkInx5m9JtP8LqihkDNmsuet3qQO+sWT9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:05:03.691762Z"},"content_sha256":"9548d3bf80bf2d748d11c1eb5cb8809f42e6c896d2ddebc74909d4e6fb32fa1d","schema_version":"1.0","event_id":"sha256:9548d3bf80bf2d748d11c1eb5cb8809f42e6c896d2ddebc74909d4e6fb32fa1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NESA4VTT24QZKTPZD4L3UKTJHP/bundle.json","state_url":"https://pith.science/pith/NESA4VTT24QZKTPZD4L3UKTJHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NESA4VTT24QZKTPZD4L3UKTJHP/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-26T23:05:03Z","links":{"resolver":"https://pith.science/pith/NESA4VTT24QZKTPZD4L3UKTJHP","bundle":"https://pith.science/pith/NESA4VTT24QZKTPZD4L3UKTJHP/bundle.json","state":"https://pith.science/pith/NESA4VTT24QZKTPZD4L3UKTJHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NESA4VTT24QZKTPZD4L3UKTJHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NESA4VTT24QZKTPZD4L3UKTJHP","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":"015a77ab3185e3194ea06e061579dd1b618ce13f8666ca1d1210b02a85a05fcd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T15:20:22Z","title_canon_sha256":"bf5edd5c911311daf55e66c800b03e93c900e4fe8a87d45143fdea56447a51e1"},"schema_version":"1.0","source":{"id":"1207.5722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5722","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5722v1","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5722","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"NESA4VTT24QZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NESA4VTT24QZKTPZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NESA4VTT","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:9548d3bf80bf2d748d11c1eb5cb8809f42e6c896d2ddebc74909d4e6fb32fa1d","target":"graph","created_at":"2026-05-18T03:50:11Z","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":"We design and analyse approximation algorithms for the minimum-cost connected T-join problem: given an undirected graph G = (V;E) with nonnegative costs on the edges, and a subset of nodes T, find (if it exists) a spanning connected subgraph H of minimum cost such that every node in T has odd degree and every node not in T has even degree; H may have multiple copies of any edge of G. Two well-known special cases are the TSP (|T| = 0) and the s-t path TSP (|T| = 2). Recently, An, Kleinberg, and Shmoys [STOC 2012] improved on the long-standing 5/3-approximation guarantee for the latter problem a","authors_text":"Joseph Cheriyan, Zachary Friggstad, Zhihan Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T15:20:22Z","title":"Approximating Minimum-Cost Connected T-Joins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5722","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:95c2dd56fd7d7210d1fc44d65b1ddd333889b57b1d8a2df9436a957a807b6160","target":"record","created_at":"2026-05-18T03:50:11Z","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":"015a77ab3185e3194ea06e061579dd1b618ce13f8666ca1d1210b02a85a05fcd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T15:20:22Z","title_canon_sha256":"bf5edd5c911311daf55e66c800b03e93c900e4fe8a87d45143fdea56447a51e1"},"schema_version":"1.0","source":{"id":"1207.5722","kind":"arxiv","version":1}},"canonical_sha256":"69240e5673d721954df91f17ba2a693bf1715c815a93606583aaa2fb33e78d24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69240e5673d721954df91f17ba2a693bf1715c815a93606583aaa2fb33e78d24","first_computed_at":"2026-05-18T03:50:11.506574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:11.506574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WtBLJbf6mcHHdx31+uUHCeoQNIygdiBg1WUC/Y9YVQlI53qBlusRV39o/KuW2Kzp9TaGgZXPagjuhCkA5NwZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:11.507445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95c2dd56fd7d7210d1fc44d65b1ddd333889b57b1d8a2df9436a957a807b6160","sha256:9548d3bf80bf2d748d11c1eb5cb8809f42e6c896d2ddebc74909d4e6fb32fa1d"],"state_sha256":"9b6ae959dd0bedf24646ac084a092928417656f1bd570264d80d1cb4e9e0aceb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Z2LrF2fbOeo+2YNHw6dwNZQro0JJeohMFTjBzQBK0O8xW+EenHcesjruUiiYsX1HYvJJUG8BrNTekW0hCvZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:05:03.694922Z","bundle_sha256":"630b73ad0a93ea0c2cc1c272572efc2b037a1555e9198226ab52ef35e0f20302"}}