{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XDCP2URCR6PO6U2LWZAHLNNHHS","short_pith_number":"pith:XDCP2URC","canonical_record":{"source":{"id":"1904.11946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T17:24:27Z","cross_cats_sorted":[],"title_canon_sha256":"80b6d234264208df8b292c24793d2efb1453bc2db9b5a3af1317d0b527e12595","abstract_canon_sha256":"221583880d3be4e4a140435b67049d4b4be3a74e5329ee6f0f66efdf2abaef7c"},"schema_version":"1.0"},"canonical_sha256":"b8c4fd52228f9eef534bb64075b5a73cba1c69b418d5d24b042252cd2689c65a","source":{"kind":"arxiv","id":"1904.11946","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11946","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11946v1","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11946","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"pith_short_12","alias_value":"XDCP2URCR6PO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XDCP2URCR6PO6U2L","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XDCP2URC","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XDCP2URCR6PO6U2LWZAHLNNHHS","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T17:24:27Z","cross_cats_sorted":[],"title_canon_sha256":"80b6d234264208df8b292c24793d2efb1453bc2db9b5a3af1317d0b527e12595","abstract_canon_sha256":"221583880d3be4e4a140435b67049d4b4be3a74e5329ee6f0f66efdf2abaef7c"},"schema_version":"1.0"},"canonical_sha256":"b8c4fd52228f9eef534bb64075b5a73cba1c69b418d5d24b042252cd2689c65a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:40.555531Z","signature_b64":"hMW0+qHzuo3kufESvEqmQJZjwj+QFqYEOspTn2sjjQsGFG3Chy5PBTH29F0GZ1uxZQmLySGTkjlPVF2uk0XGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8c4fd52228f9eef534bb64075b5a73cba1c69b418d5d24b042252cd2689c65a","last_reissued_at":"2026-05-17T23:47:40.555052Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:40.555052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11946","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":"aTFX8vJ1VWUc3+y0h4YZngMuqIKdy+DqY5cFIcLzAk/ztwLK4+SzYfMJtdk/UQPGL5fG2ELERYrPQPLtO+S7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:11:35.220010Z"},"content_sha256":"8c47956a60912cdb95e6883b5e1ecdc95b6f3fd53e842757e456a954181ffaa3","schema_version":"1.0","event_id":"sha256:8c47956a60912cdb95e6883b5e1ecdc95b6f3fd53e842757e456a954181ffaa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XDCP2URCR6PO6U2LWZAHLNNHHS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Retracting Graphs to Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bruce M. Maggs, Debmalya Panigrahi, Mehraneh Liaee, Rajmohan Rajaraman, Ravi Sundaram, Samuel Haney","submitted_at":"2019-04-26T17:24:27Z","abstract_excerpt":"We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the restriction of the mapping to the cycle is the identity map. This problem has its roots in the rich theory of retraction of topological spaces, and has strong ties to well-studied metric embedding problems such as minimum bandwidth and 0-extension.\n  Our first result is an O(min{k, sqrt{n}})-approximation for retracting any graph on n nodes to a cycle with k nod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11946","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":"p1AkLyi2JSDOpDJpYrtH1C5czAYh7wWHLAGDXPfkKOFq6IGLKEFuLUaxtkcOdHhHeFutqRUnkKdVu07JCFtfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:11:35.220376Z"},"content_sha256":"983b25de2603c3117fd78426adfec09aefa910b254ac08d40a29bb976acd0db3","schema_version":"1.0","event_id":"sha256:983b25de2603c3117fd78426adfec09aefa910b254ac08d40a29bb976acd0db3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDCP2URCR6PO6U2LWZAHLNNHHS/bundle.json","state_url":"https://pith.science/pith/XDCP2URCR6PO6U2LWZAHLNNHHS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDCP2URCR6PO6U2LWZAHLNNHHS/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-06-05T03:11:35Z","links":{"resolver":"https://pith.science/pith/XDCP2URCR6PO6U2LWZAHLNNHHS","bundle":"https://pith.science/pith/XDCP2URCR6PO6U2LWZAHLNNHHS/bundle.json","state":"https://pith.science/pith/XDCP2URCR6PO6U2LWZAHLNNHHS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDCP2URCR6PO6U2LWZAHLNNHHS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XDCP2URCR6PO6U2LWZAHLNNHHS","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":"221583880d3be4e4a140435b67049d4b4be3a74e5329ee6f0f66efdf2abaef7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T17:24:27Z","title_canon_sha256":"80b6d234264208df8b292c24793d2efb1453bc2db9b5a3af1317d0b527e12595"},"schema_version":"1.0","source":{"id":"1904.11946","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11946","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11946v1","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11946","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"pith_short_12","alias_value":"XDCP2URCR6PO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XDCP2URCR6PO6U2L","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XDCP2URC","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:983b25de2603c3117fd78426adfec09aefa910b254ac08d40a29bb976acd0db3","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":"We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the restriction of the mapping to the cycle is the identity map. This problem has its roots in the rich theory of retraction of topological spaces, and has strong ties to well-studied metric embedding problems such as minimum bandwidth and 0-extension.\n  Our first result is an O(min{k, sqrt{n}})-approximation for retracting any graph on n nodes to a cycle with k nod","authors_text":"Bruce M. Maggs, Debmalya Panigrahi, Mehraneh Liaee, Rajmohan Rajaraman, Ravi Sundaram, Samuel Haney","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T17:24:27Z","title":"Retracting Graphs to Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11946","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:8c47956a60912cdb95e6883b5e1ecdc95b6f3fd53e842757e456a954181ffaa3","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":"221583880d3be4e4a140435b67049d4b4be3a74e5329ee6f0f66efdf2abaef7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T17:24:27Z","title_canon_sha256":"80b6d234264208df8b292c24793d2efb1453bc2db9b5a3af1317d0b527e12595"},"schema_version":"1.0","source":{"id":"1904.11946","kind":"arxiv","version":1}},"canonical_sha256":"b8c4fd52228f9eef534bb64075b5a73cba1c69b418d5d24b042252cd2689c65a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8c4fd52228f9eef534bb64075b5a73cba1c69b418d5d24b042252cd2689c65a","first_computed_at":"2026-05-17T23:47:40.555052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:40.555052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hMW0+qHzuo3kufESvEqmQJZjwj+QFqYEOspTn2sjjQsGFG3Chy5PBTH29F0GZ1uxZQmLySGTkjlPVF2uk0XGCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:40.555531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11946","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c47956a60912cdb95e6883b5e1ecdc95b6f3fd53e842757e456a954181ffaa3","sha256:983b25de2603c3117fd78426adfec09aefa910b254ac08d40a29bb976acd0db3"],"state_sha256":"6be4b407d6cd82b4438afcd603d868fd663938e4cd24e38fac5ac8906621c4cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tVAPVRrVU7xRPz8auQB0dUo/E32L69NoU2OMHpg8X+HRwbxXQi6hAB/djr7DXMPtoFioG5h1bXBdCcBFh6z8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:11:35.222490Z","bundle_sha256":"95c93d33e0de51129ecf8e39a2b2dba3680d0c9858ab25ea47dca9931bc9ff34"}}