{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WVRL7AIR3ZTLJW2APUZWKCRADG","short_pith_number":"pith:WVRL7AIR","canonical_record":{"source":{"id":"2606.05546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-04T01:00:02Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b5af7fc662da1b87b78010e6871475c83d77916f5c4795acc5946aa53f54bc32","abstract_canon_sha256":"23aff857dedf9b4a897d76cca9f3d31f6a5efe956b0d69724010876766ef5052"},"schema_version":"1.0"},"canonical_sha256":"b562bf8111de66b4db407d33650a2019a494a66372018b3b6110487ee1cce8c4","source":{"kind":"arxiv","id":"2606.05546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05546","created_at":"2026-06-05T01:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05546v1","created_at":"2026-06-05T01:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05546","created_at":"2026-06-05T01:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"WVRL7AIR3ZTL","created_at":"2026-06-05T01:14:54Z"},{"alias_kind":"pith_short_16","alias_value":"WVRL7AIR3ZTLJW2A","created_at":"2026-06-05T01:14:54Z"},{"alias_kind":"pith_short_8","alias_value":"WVRL7AIR","created_at":"2026-06-05T01:14:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WVRL7AIR3ZTLJW2APUZWKCRADG","target":"record","payload":{"canonical_record":{"source":{"id":"2606.05546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-04T01:00:02Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b5af7fc662da1b87b78010e6871475c83d77916f5c4795acc5946aa53f54bc32","abstract_canon_sha256":"23aff857dedf9b4a897d76cca9f3d31f6a5efe956b0d69724010876766ef5052"},"schema_version":"1.0"},"canonical_sha256":"b562bf8111de66b4db407d33650a2019a494a66372018b3b6110487ee1cce8c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:14:54.398311Z","signature_b64":"n8giDeLMx6yj3SWDA6grrdExRR2Z4Rq6XNuSI6ehOT7xecof6AXsvZgQy7IE26tA2fZGISvHxIjgGERyRtsRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b562bf8111de66b4db407d33650a2019a494a66372018b3b6110487ee1cce8c4","last_reissued_at":"2026-06-05T01:14:54.397823Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:14:54.397823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.05546","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-06-05T01:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brDIcC6B/WZfo+J0zyiFlcC54meifZeBUFZXGTcavccBd6lY40CZvlD/YHZAXcCdmYaw3Soe+Es6FIbR8S9LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:41:49.222860Z"},"content_sha256":"9d6044e369a6fc314cbe1c86ac80a1e2472bb0c29194023930fa00fd06f89cab","schema_version":"1.0","event_id":"sha256:9d6044e369a6fc314cbe1c86ac80a1e2472bb0c29194023930fa00fd06f89cab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WVRL7AIR3ZTLJW2APUZWKCRADG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Min-Cost Matching with General Arrivals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Eric Balkanski, Jason Chatzitheodorou, Josh Ascher, Vasilis Gkatzelis","submitted_at":"2026-06-04T01:00:02Z","abstract_excerpt":"In the classic online min-cost matching problem, the goal is to match a sequence of requests that arrive dynamically over time to a set of static servers, aiming to minimize the total cost of the matching. This assumes that there are two distinct \"sides\" and that only one of these sides arrives online, but many of the motivating applications violate these assumptions. We study online min-cost perfect-matching when \\emph{all} participants arrive online and, upon arrival, they need to either be matched to someone from a waiting pool or to join the waiting pool. We evaluate the competitive ratios"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05546","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/2606.05546/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-06-05T01:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gv0mEz+d4INB95i6gyC0YreBqMa8PAnOWrQN5VSwDJYI6RSiR6nO5HsdGScfwBQubTzkEIrxSuT/2QXb1DwgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:41:49.223663Z"},"content_sha256":"b0ffefc122f9cc013606f3248ebd5054c5a357878828d5a3de58e5a8cddb5070","schema_version":"1.0","event_id":"sha256:b0ffefc122f9cc013606f3248ebd5054c5a357878828d5a3de58e5a8cddb5070"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVRL7AIR3ZTLJW2APUZWKCRADG/bundle.json","state_url":"https://pith.science/pith/WVRL7AIR3ZTLJW2APUZWKCRADG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVRL7AIR3ZTLJW2APUZWKCRADG/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-09T03:41:49Z","links":{"resolver":"https://pith.science/pith/WVRL7AIR3ZTLJW2APUZWKCRADG","bundle":"https://pith.science/pith/WVRL7AIR3ZTLJW2APUZWKCRADG/bundle.json","state":"https://pith.science/pith/WVRL7AIR3ZTLJW2APUZWKCRADG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVRL7AIR3ZTLJW2APUZWKCRADG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WVRL7AIR3ZTLJW2APUZWKCRADG","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":"23aff857dedf9b4a897d76cca9f3d31f6a5efe956b0d69724010876766ef5052","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-04T01:00:02Z","title_canon_sha256":"b5af7fc662da1b87b78010e6871475c83d77916f5c4795acc5946aa53f54bc32"},"schema_version":"1.0","source":{"id":"2606.05546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05546","created_at":"2026-06-05T01:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05546v1","created_at":"2026-06-05T01:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05546","created_at":"2026-06-05T01:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"WVRL7AIR3ZTL","created_at":"2026-06-05T01:14:54Z"},{"alias_kind":"pith_short_16","alias_value":"WVRL7AIR3ZTLJW2A","created_at":"2026-06-05T01:14:54Z"},{"alias_kind":"pith_short_8","alias_value":"WVRL7AIR","created_at":"2026-06-05T01:14:54Z"}],"graph_snapshots":[{"event_id":"sha256:b0ffefc122f9cc013606f3248ebd5054c5a357878828d5a3de58e5a8cddb5070","target":"graph","created_at":"2026-06-05T01:14:54Z","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/2606.05546/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the classic online min-cost matching problem, the goal is to match a sequence of requests that arrive dynamically over time to a set of static servers, aiming to minimize the total cost of the matching. This assumes that there are two distinct \"sides\" and that only one of these sides arrives online, but many of the motivating applications violate these assumptions. We study online min-cost perfect-matching when \\emph{all} participants arrive online and, upon arrival, they need to either be matched to someone from a waiting pool or to join the waiting pool. We evaluate the competitive ratios","authors_text":"Eric Balkanski, Jason Chatzitheodorou, Josh Ascher, Vasilis Gkatzelis","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-04T01:00:02Z","title":"Online Min-Cost Matching with General Arrivals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05546","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:9d6044e369a6fc314cbe1c86ac80a1e2472bb0c29194023930fa00fd06f89cab","target":"record","created_at":"2026-06-05T01:14:54Z","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":"23aff857dedf9b4a897d76cca9f3d31f6a5efe956b0d69724010876766ef5052","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-04T01:00:02Z","title_canon_sha256":"b5af7fc662da1b87b78010e6871475c83d77916f5c4795acc5946aa53f54bc32"},"schema_version":"1.0","source":{"id":"2606.05546","kind":"arxiv","version":1}},"canonical_sha256":"b562bf8111de66b4db407d33650a2019a494a66372018b3b6110487ee1cce8c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b562bf8111de66b4db407d33650a2019a494a66372018b3b6110487ee1cce8c4","first_computed_at":"2026-06-05T01:14:54.397823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:14:54.397823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n8giDeLMx6yj3SWDA6grrdExRR2Z4Rq6XNuSI6ehOT7xecof6AXsvZgQy7IE26tA2fZGISvHxIjgGERyRtsRCw==","signature_status":"signed_v1","signed_at":"2026-06-05T01:14:54.398311Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.05546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d6044e369a6fc314cbe1c86ac80a1e2472bb0c29194023930fa00fd06f89cab","sha256:b0ffefc122f9cc013606f3248ebd5054c5a357878828d5a3de58e5a8cddb5070"],"state_sha256":"697b1c9e33bface9315c4d23c123810c19d4fd3000fb531b197982be80be2123"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y1ebmlAf8YgoGlEi6eATs5ViHKYxfvmw3ZonnZgswWmrhyjE1fIzYOcT4Di7QpBzTuXRtQNVpfb/OYfsjYlzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:41:49.228095Z","bundle_sha256":"a3bcaeace39a434cbbfaf3110622644c56a0d69db4e8db5a5b681c0a4d19eba2"}}