{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:B2TVRHQWV3SQMGBACPMYO2P6IO","short_pith_number":"pith:B2TVRHQW","canonical_record":{"source":{"id":"2307.08213","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-17T03:10:38Z","cross_cats_sorted":[],"title_canon_sha256":"c7b5abddddeb92f02b8d0d1beb34ad9d8296a49ae313e5a1e0c88aa78bddbf68","abstract_canon_sha256":"c59c2943cc138def8d8450d8321115497ff72781e215d404ea08e5c1fb945bba"},"schema_version":"1.0"},"canonical_sha256":"0ea7589e16aee506182013d98769fe43b9420200aba9bf459c6fa67ef4d68715","source":{"kind":"arxiv","id":"2307.08213","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.08213","created_at":"2026-07-05T09:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"2307.08213v2","created_at":"2026-07-05T09:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08213","created_at":"2026-07-05T09:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"B2TVRHQWV3SQ","created_at":"2026-07-05T09:20:37Z"},{"alias_kind":"pith_short_16","alias_value":"B2TVRHQWV3SQMGBA","created_at":"2026-07-05T09:20:37Z"},{"alias_kind":"pith_short_8","alias_value":"B2TVRHQW","created_at":"2026-07-05T09:20:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:B2TVRHQWV3SQMGBACPMYO2P6IO","target":"record","payload":{"canonical_record":{"source":{"id":"2307.08213","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-17T03:10:38Z","cross_cats_sorted":[],"title_canon_sha256":"c7b5abddddeb92f02b8d0d1beb34ad9d8296a49ae313e5a1e0c88aa78bddbf68","abstract_canon_sha256":"c59c2943cc138def8d8450d8321115497ff72781e215d404ea08e5c1fb945bba"},"schema_version":"1.0"},"canonical_sha256":"0ea7589e16aee506182013d98769fe43b9420200aba9bf459c6fa67ef4d68715","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:37.081445Z","signature_b64":"zju6ywCQX9yB4LZnSfu0jqWRjGfDh3CQkrsnH3OY5sAbku7+uaIV1q7csN3R9HrZbSp8IrYzHy1vb2/NhjWMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ea7589e16aee506182013d98769fe43b9420200aba9bf459c6fa67ef4d68715","last_reissued_at":"2026-07-05T09:20:37.080919Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:37.080919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.08213","source_version":2,"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-05T09:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KNj1+dbKstGePoCNUic4dJjodzcnazm0IquL3LV2906g1ex3mRZ4twhleA/HTqucraF0tylMm9oADWQm1/pNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:38:49.282840Z"},"content_sha256":"f11a543bd0c79182cbda2fe741c984b75e01f9aff27a5a5ab95bd573672cf353","schema_version":"1.0","event_id":"sha256:f11a543bd0c79182cbda2fe741c984b75e01f9aff27a5a5ab95bd573672cf353"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:B2TVRHQWV3SQMGBACPMYO2P6IO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lipschitz Continuous Algorithms for Covering Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Soh Kumabe, Yuichi Yoshida","submitted_at":"2023-07-17T03:10:38Z","abstract_excerpt":"Combinatorial algorithms are widely used for decision-making and knowledge discovery, and it is important to ensure that their output remains stable even when subjected to small perturbations in the input. Failure to do so can lead to several problems, including costly decisions, reduced user trust, potential security concerns, and lack of replicability. Unfortunately, many fundamental combinatorial algorithms are vulnerable to small input perturbations. To address the impact of input perturbations on algorithms for weighted graph problems, Kumabe and Yoshida (FOCS'23) recently introduced the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08213","kind":"arxiv","version":2},"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/2307.08213/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-05T09:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXB+Rp+gyF2PjgAJFjZEK1yZlyRsN9AT/5k7Mbp6Qyr0me3jjYouGKZOYr9XAs5agNo2qIJDBWxbvXN2eNOqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:38:49.283824Z"},"content_sha256":"4bcf067342d4cb1683e9cc32ee0572dc86d59d8af3e807c6fdd21776c8eb685c","schema_version":"1.0","event_id":"sha256:4bcf067342d4cb1683e9cc32ee0572dc86d59d8af3e807c6fdd21776c8eb685c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2TVRHQWV3SQMGBACPMYO2P6IO/bundle.json","state_url":"https://pith.science/pith/B2TVRHQWV3SQMGBACPMYO2P6IO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2TVRHQWV3SQMGBACPMYO2P6IO/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-08-04T04:38:49Z","links":{"resolver":"https://pith.science/pith/B2TVRHQWV3SQMGBACPMYO2P6IO","bundle":"https://pith.science/pith/B2TVRHQWV3SQMGBACPMYO2P6IO/bundle.json","state":"https://pith.science/pith/B2TVRHQWV3SQMGBACPMYO2P6IO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2TVRHQWV3SQMGBACPMYO2P6IO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:B2TVRHQWV3SQMGBACPMYO2P6IO","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":"c59c2943cc138def8d8450d8321115497ff72781e215d404ea08e5c1fb945bba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-17T03:10:38Z","title_canon_sha256":"c7b5abddddeb92f02b8d0d1beb34ad9d8296a49ae313e5a1e0c88aa78bddbf68"},"schema_version":"1.0","source":{"id":"2307.08213","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.08213","created_at":"2026-07-05T09:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"2307.08213v2","created_at":"2026-07-05T09:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08213","created_at":"2026-07-05T09:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"B2TVRHQWV3SQ","created_at":"2026-07-05T09:20:37Z"},{"alias_kind":"pith_short_16","alias_value":"B2TVRHQWV3SQMGBA","created_at":"2026-07-05T09:20:37Z"},{"alias_kind":"pith_short_8","alias_value":"B2TVRHQW","created_at":"2026-07-05T09:20:37Z"}],"graph_snapshots":[{"event_id":"sha256:4bcf067342d4cb1683e9cc32ee0572dc86d59d8af3e807c6fdd21776c8eb685c","target":"graph","created_at":"2026-07-05T09:20:37Z","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/2307.08213/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial algorithms are widely used for decision-making and knowledge discovery, and it is important to ensure that their output remains stable even when subjected to small perturbations in the input. Failure to do so can lead to several problems, including costly decisions, reduced user trust, potential security concerns, and lack of replicability. Unfortunately, many fundamental combinatorial algorithms are vulnerable to small input perturbations. To address the impact of input perturbations on algorithms for weighted graph problems, Kumabe and Yoshida (FOCS'23) recently introduced the ","authors_text":"Soh Kumabe, Yuichi Yoshida","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-17T03:10:38Z","title":"Lipschitz Continuous Algorithms for Covering Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08213","kind":"arxiv","version":2},"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:f11a543bd0c79182cbda2fe741c984b75e01f9aff27a5a5ab95bd573672cf353","target":"record","created_at":"2026-07-05T09:20:37Z","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":"c59c2943cc138def8d8450d8321115497ff72781e215d404ea08e5c1fb945bba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-17T03:10:38Z","title_canon_sha256":"c7b5abddddeb92f02b8d0d1beb34ad9d8296a49ae313e5a1e0c88aa78bddbf68"},"schema_version":"1.0","source":{"id":"2307.08213","kind":"arxiv","version":2}},"canonical_sha256":"0ea7589e16aee506182013d98769fe43b9420200aba9bf459c6fa67ef4d68715","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ea7589e16aee506182013d98769fe43b9420200aba9bf459c6fa67ef4d68715","first_computed_at":"2026-07-05T09:20:37.080919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:20:37.080919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zju6ywCQX9yB4LZnSfu0jqWRjGfDh3CQkrsnH3OY5sAbku7+uaIV1q7csN3R9HrZbSp8IrYzHy1vb2/NhjWMCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:20:37.081445Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.08213","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f11a543bd0c79182cbda2fe741c984b75e01f9aff27a5a5ab95bd573672cf353","sha256:4bcf067342d4cb1683e9cc32ee0572dc86d59d8af3e807c6fdd21776c8eb685c"],"state_sha256":"98427967c90653d0662937e49594f3dc6f34de3788bb67098ef986c878c058e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3m/DCj7Dn93xL+EDu7/JX+QMGwYZ/qaMlPQvO6P5pd4wvGneTtWUyaOeIhQtE3AVlzNmRLQ1mAa1RzA9nCeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T04:38:49.295080Z","bundle_sha256":"bd3a87d9749b1b625a14af7052ebb84b1d4bd9a299758419edef56dde3af118d"}}