{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KBCY323NUNHX2PASIEM73EXHP4","short_pith_number":"pith:KBCY323N","canonical_record":{"source":{"id":"1811.10580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-26T18:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"552a121b355db22649f5f7e174de3f221bb86f5ed944ab09eb6a88787e4590f2","abstract_canon_sha256":"cd7481db1d0a77ac95a7c1ebe954d8742fc986ca7b50942953bf018667eed114"},"schema_version":"1.0"},"canonical_sha256":"50458deb6da34f7d3c124119fd92e77f3f79f409c21ef06a414482025be60e8d","source":{"kind":"arxiv","id":"1811.10580","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10580","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10580v2","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10580","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"KBCY323NUNHX","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KBCY323NUNHX2PAS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KBCY323N","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KBCY323NUNHX2PASIEM73EXHP4","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-26T18:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"552a121b355db22649f5f7e174de3f221bb86f5ed944ab09eb6a88787e4590f2","abstract_canon_sha256":"cd7481db1d0a77ac95a7c1ebe954d8742fc986ca7b50942953bf018667eed114"},"schema_version":"1.0"},"canonical_sha256":"50458deb6da34f7d3c124119fd92e77f3f79f409c21ef06a414482025be60e8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:39.663085Z","signature_b64":"gUIHoEB+cW6q48I65EM7Rf6uaEmE5T6LAoH2O8HFMOoCGa3/GdXvoWIEgqSItDtoCuOKKdTnaYaUodtASC6FDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50458deb6da34f7d3c124119fd92e77f3f79f409c21ef06a414482025be60e8d","last_reissued_at":"2026-05-17T23:47:39.662571Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:39.662571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10580","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-05-17T23:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bv68Uv2JE3z/D2f2F0ARDV/6dUX70LL8RVDX2szHilGguGYdOJsDEmpypVRri88QeVSOKVUOhyM9cXF7nb3pBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:51:15.664698Z"},"content_sha256":"8acaadf91f152a1845b803528e06ad29f83ef47e847279d8a8f05fb05a617796","schema_version":"1.0","event_id":"sha256:8acaadf91f152a1845b803528e06ad29f83ef47e847279d8a8f05fb05a617796"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KBCY323NUNHX2PASIEM73EXHP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maintaining Perfect Matchings at Low Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jannik Matuschke, Jos\\'e Verschae, Ulrike Schmidt-Kraepelin","submitted_at":"2018-11-26T18:36:11Z","abstract_excerpt":"The min-cost matching problem suffers from being very sensitive to small changes of the input. Even in a simple setting, e.g., when the costs come from the metric on the line, adding two nodes to the input might change the optimal solution completely. On the other hand, one expects that small changes in the input should incur only small changes on the constructed solutions, measured as the number of modified edges. We introduce a two-stage model where we study the trade-off between quality and robustness of solutions. In the first stage we are given a set of nodes in a metric space and we must"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10580","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":""},"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:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyjHn+jI9OoeeQtWX5VYxh87NRsBewjJ/4wugJkbWESulOmB2iXQ2O3OoCHvrf1RvXkk+vEMLdyu29+SFZMyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:51:15.665057Z"},"content_sha256":"ec4a44fcf511757582a1b3b374f82244792c97ff0c0e4a76a7772d182d2657fe","schema_version":"1.0","event_id":"sha256:ec4a44fcf511757582a1b3b374f82244792c97ff0c0e4a76a7772d182d2657fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBCY323NUNHX2PASIEM73EXHP4/bundle.json","state_url":"https://pith.science/pith/KBCY323NUNHX2PASIEM73EXHP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBCY323NUNHX2PASIEM73EXHP4/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-03T17:51:15Z","links":{"resolver":"https://pith.science/pith/KBCY323NUNHX2PASIEM73EXHP4","bundle":"https://pith.science/pith/KBCY323NUNHX2PASIEM73EXHP4/bundle.json","state":"https://pith.science/pith/KBCY323NUNHX2PASIEM73EXHP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBCY323NUNHX2PASIEM73EXHP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KBCY323NUNHX2PASIEM73EXHP4","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":"cd7481db1d0a77ac95a7c1ebe954d8742fc986ca7b50942953bf018667eed114","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-26T18:36:11Z","title_canon_sha256":"552a121b355db22649f5f7e174de3f221bb86f5ed944ab09eb6a88787e4590f2"},"schema_version":"1.0","source":{"id":"1811.10580","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10580","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10580v2","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10580","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"KBCY323NUNHX","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KBCY323NUNHX2PAS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KBCY323N","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:ec4a44fcf511757582a1b3b374f82244792c97ff0c0e4a76a7772d182d2657fe","target":"graph","created_at":"2026-05-17T23:47:39Z","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 min-cost matching problem suffers from being very sensitive to small changes of the input. Even in a simple setting, e.g., when the costs come from the metric on the line, adding two nodes to the input might change the optimal solution completely. On the other hand, one expects that small changes in the input should incur only small changes on the constructed solutions, measured as the number of modified edges. We introduce a two-stage model where we study the trade-off between quality and robustness of solutions. In the first stage we are given a set of nodes in a metric space and we must","authors_text":"Jannik Matuschke, Jos\\'e Verschae, Ulrike Schmidt-Kraepelin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-26T18:36:11Z","title":"Maintaining Perfect Matchings at Low Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10580","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:8acaadf91f152a1845b803528e06ad29f83ef47e847279d8a8f05fb05a617796","target":"record","created_at":"2026-05-17T23:47:39Z","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":"cd7481db1d0a77ac95a7c1ebe954d8742fc986ca7b50942953bf018667eed114","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-26T18:36:11Z","title_canon_sha256":"552a121b355db22649f5f7e174de3f221bb86f5ed944ab09eb6a88787e4590f2"},"schema_version":"1.0","source":{"id":"1811.10580","kind":"arxiv","version":2}},"canonical_sha256":"50458deb6da34f7d3c124119fd92e77f3f79f409c21ef06a414482025be60e8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50458deb6da34f7d3c124119fd92e77f3f79f409c21ef06a414482025be60e8d","first_computed_at":"2026-05-17T23:47:39.662571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:39.662571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gUIHoEB+cW6q48I65EM7Rf6uaEmE5T6LAoH2O8HFMOoCGa3/GdXvoWIEgqSItDtoCuOKKdTnaYaUodtASC6FDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:39.663085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10580","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8acaadf91f152a1845b803528e06ad29f83ef47e847279d8a8f05fb05a617796","sha256:ec4a44fcf511757582a1b3b374f82244792c97ff0c0e4a76a7772d182d2657fe"],"state_sha256":"8aa4d4f77e35abe155a9caf1644f6a60865ff84e96e2e6cb8d95a988d8a41a74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOOdFjn+4goNCx5BwaliHJM5t2E/+Cg97r6AkKDbHKQ0d0TZYQVVRki3OFEr/JusO0awvruMLgnlLm3/yZzGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:51:15.667118Z","bundle_sha256":"7c13195d845254bb1c7d6f888567135615daf4eba336ff52207efd429d7ef5dc"}}