{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VJHVNFQXM4LSPL75RGCYKD75VA","short_pith_number":"pith:VJHVNFQX","canonical_record":{"source":{"id":"2008.03327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-07T18:20:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dd22700032d8045c66d23319ee60c9784155529cc27d50036d7f355536d0fce0","abstract_canon_sha256":"3894247bb2c970b87ec501d1b0ed91d6d2f5fd15980b49e72b25ad70fde44ab2"},"schema_version":"1.0"},"canonical_sha256":"aa4f569617671727affd8985850ffda8018e776d25170408c55e4638fb23b261","source":{"kind":"arxiv","id":"2008.03327","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.03327","created_at":"2026-07-05T01:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"2008.03327v1","created_at":"2026-07-05T01:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.03327","created_at":"2026-07-05T01:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"VJHVNFQXM4LS","created_at":"2026-07-05T01:25:40Z"},{"alias_kind":"pith_short_16","alias_value":"VJHVNFQXM4LSPL75","created_at":"2026-07-05T01:25:40Z"},{"alias_kind":"pith_short_8","alias_value":"VJHVNFQX","created_at":"2026-07-05T01:25:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VJHVNFQXM4LSPL75RGCYKD75VA","target":"record","payload":{"canonical_record":{"source":{"id":"2008.03327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-07T18:20:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dd22700032d8045c66d23319ee60c9784155529cc27d50036d7f355536d0fce0","abstract_canon_sha256":"3894247bb2c970b87ec501d1b0ed91d6d2f5fd15980b49e72b25ad70fde44ab2"},"schema_version":"1.0"},"canonical_sha256":"aa4f569617671727affd8985850ffda8018e776d25170408c55e4638fb23b261","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:40.619991Z","signature_b64":"BjpCbFEJ82vH3FHR5KNPZQX7qZsjLwW8GDHjQ04WXGkNioKtgDTduNiJ2yHKuEYOd1Sup7bBT8Uxy2OO/GI7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa4f569617671727affd8985850ffda8018e776d25170408c55e4638fb23b261","last_reissued_at":"2026-07-05T01:25:40.619483Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:40.619483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.03327","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-07-05T01:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4S2h5KVVDuqpNWX2Dzvv2ZdVFSIX7ShzMtqFpfw0ql6uCjL21kYmgajaFK8DhAHVYZvJlqLEEb8pPCkIzIuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:44:53.606406Z"},"content_sha256":"b2dbb9028e93fb4acc9363c25d0e3940e6583840768f7f18ec5d2be0a84cec05","schema_version":"1.0","event_id":"sha256:b2dbb9028e93fb4acc9363c25d0e3940e6583840768f7f18ec5d2be0a84cec05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VJHVNFQXM4LSPL75RGCYKD75VA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"J.Cheriyan, L.Grout, L.Wang, R.Cummings, S.Boyd, S.Ibrahimpur, Z.Szigeti","submitted_at":"2020-08-07T18:20:39Z","abstract_excerpt":"Given a connected undirected graph $\\bar{G}$ on $n$ vertices, and non-negative edge costs $c$, the 2ECM problem is that of finding a $2$-edge~connected spanning multisubgraph of $\\bar{G}$ of minimum cost. The natural linear program (LP) for 2ECM, which coincides with the subtour LP for the Traveling Salesman Problem on the metric closure of $\\bar{G}$, gives a lower bound on the optimal cost. For instances where this LP is optimized by a half-integral solution $x$, Carr and Ravi (1998) showed that the integrality gap is at most $\\frac43$: they show that the vector $\\frac43 x$ dominates a convex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.03327","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/2008.03327/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1pH51BlBliLSF9fnV67wzZYw73VFQCq9AZfgDZlmV765sU6xnjXjadvoRREAkOucy320XXJ8iHxf2wCdpXB6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:44:53.606788Z"},"content_sha256":"409f575ae9f7be9f799a15110892118aadabff3f6e628354280461665c350eac","schema_version":"1.0","event_id":"sha256:409f575ae9f7be9f799a15110892118aadabff3f6e628354280461665c350eac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA/bundle.json","state_url":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJHVNFQXM4LSPL75RGCYKD75VA/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-07-06T11:44:53Z","links":{"resolver":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA","bundle":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA/bundle.json","state":"https://pith.science/pith/VJHVNFQXM4LSPL75RGCYKD75VA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJHVNFQXM4LSPL75RGCYKD75VA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VJHVNFQXM4LSPL75RGCYKD75VA","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":"3894247bb2c970b87ec501d1b0ed91d6d2f5fd15980b49e72b25ad70fde44ab2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-07T18:20:39Z","title_canon_sha256":"dd22700032d8045c66d23319ee60c9784155529cc27d50036d7f355536d0fce0"},"schema_version":"1.0","source":{"id":"2008.03327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.03327","created_at":"2026-07-05T01:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"2008.03327v1","created_at":"2026-07-05T01:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.03327","created_at":"2026-07-05T01:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"VJHVNFQXM4LS","created_at":"2026-07-05T01:25:40Z"},{"alias_kind":"pith_short_16","alias_value":"VJHVNFQXM4LSPL75","created_at":"2026-07-05T01:25:40Z"},{"alias_kind":"pith_short_8","alias_value":"VJHVNFQX","created_at":"2026-07-05T01:25:40Z"}],"graph_snapshots":[{"event_id":"sha256:409f575ae9f7be9f799a15110892118aadabff3f6e628354280461665c350eac","target":"graph","created_at":"2026-07-05T01:25: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.03327/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a connected undirected graph $\\bar{G}$ on $n$ vertices, and non-negative edge costs $c$, the 2ECM problem is that of finding a $2$-edge~connected spanning multisubgraph of $\\bar{G}$ of minimum cost. The natural linear program (LP) for 2ECM, which coincides with the subtour LP for the Traveling Salesman Problem on the metric closure of $\\bar{G}$, gives a lower bound on the optimal cost. For instances where this LP is optimized by a half-integral solution $x$, Carr and Ravi (1998) showed that the integrality gap is at most $\\frac43$: they show that the vector $\\frac43 x$ dominates a convex","authors_text":"J.Cheriyan, L.Grout, L.Wang, R.Cummings, S.Boyd, S.Ibrahimpur, Z.Szigeti","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-07T18:20:39Z","title":"A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.03327","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:b2dbb9028e93fb4acc9363c25d0e3940e6583840768f7f18ec5d2be0a84cec05","target":"record","created_at":"2026-07-05T01:25: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":"3894247bb2c970b87ec501d1b0ed91d6d2f5fd15980b49e72b25ad70fde44ab2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-07T18:20:39Z","title_canon_sha256":"dd22700032d8045c66d23319ee60c9784155529cc27d50036d7f355536d0fce0"},"schema_version":"1.0","source":{"id":"2008.03327","kind":"arxiv","version":1}},"canonical_sha256":"aa4f569617671727affd8985850ffda8018e776d25170408c55e4638fb23b261","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa4f569617671727affd8985850ffda8018e776d25170408c55e4638fb23b261","first_computed_at":"2026-07-05T01:25:40.619483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:25:40.619483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BjpCbFEJ82vH3FHR5KNPZQX7qZsjLwW8GDHjQ04WXGkNioKtgDTduNiJ2yHKuEYOd1Sup7bBT8Uxy2OO/GI7Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T01:25:40.619991Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.03327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2dbb9028e93fb4acc9363c25d0e3940e6583840768f7f18ec5d2be0a84cec05","sha256:409f575ae9f7be9f799a15110892118aadabff3f6e628354280461665c350eac"],"state_sha256":"c860ccc65569bcdd149e103b523525efcf45902cf9a5700fb6dac0ce3c945800"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+b54mRNVW+hq+bWFshTA+b9Wxb/aBLUaZbp+9e3hEYZIkjsiMWua9KG4q6HhZMrkU9LsE3OVPxWyL5qhbDgYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T11:44:53.609067Z","bundle_sha256":"1f13f7746958499902c5bc8a00c875fe38b4f265cc4a3ff49863da6ee4db1708"}}