{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QACLVWG2N6N6F7OFF5V33UGID4","short_pith_number":"pith:QACLVWG2","canonical_record":{"source":{"id":"1803.01285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-04T02:36:15Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"6201ceed667eebd83545a3d1883e3ee9fb500356f592d33c1477e882021984f8","abstract_canon_sha256":"daac9c38aab43559de89500073be7de7f37de0ee97ca4802dde44ada4cc98cc8"},"schema_version":"1.0"},"canonical_sha256":"8004bad8da6f9be2fdc52f6bbdd0c81f12ea69f7963f852a66cdcff34cc69e17","source":{"kind":"arxiv","id":"1803.01285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01285","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01285v1","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01285","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"QACLVWG2N6N6","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QACLVWG2N6N6F7OF","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QACLVWG2","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QACLVWG2N6N6F7OFF5V33UGID4","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-04T02:36:15Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"6201ceed667eebd83545a3d1883e3ee9fb500356f592d33c1477e882021984f8","abstract_canon_sha256":"daac9c38aab43559de89500073be7de7f37de0ee97ca4802dde44ada4cc98cc8"},"schema_version":"1.0"},"canonical_sha256":"8004bad8da6f9be2fdc52f6bbdd0c81f12ea69f7963f852a66cdcff34cc69e17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:01.182747Z","signature_b64":"1d7IbFF8/vR3iYOxnkh5+ojsArResOvqaYvAQzRK+TCR/dOd5YaBpACgpFZgORXiUvUCdZhEDH7O3Bio0OWrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8004bad8da6f9be2fdc52f6bbdd0c81f12ea69f7963f852a66cdcff34cc69e17","last_reissued_at":"2026-05-18T00:22:01.182133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:01.182133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01285","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-18T00:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usRdNxKSOmdoEjRgTmca/HNaWbmeLmx3LkFGJgjJSZtz02b0CwyubfbGfa650luk9tQaq5BVk9qFVD6LUDjoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:54:02.034899Z"},"content_sha256":"781b0191fd448f357cf47d3b438c6ec9a1e325edf15f3be0c4d6680096afe170","schema_version":"1.0","event_id":"sha256:781b0191fd448f357cf47d3b438c6ec9a1e325edf15f3be0c4d6680096afe170"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QACLVWG2N6N6F7OFF5V33UGID4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing Efficiency in Dynamic Matching Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Itai Ashlagi, Maximilien Burq, Patrick Jaillet","submitted_at":"2018-03-04T02:36:15Z","abstract_excerpt":"We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and the planner's goal is to maximize the total value over a finite time horizon. We study matching algorithms that perform well over any sequence of arrivals when there is no a priori information about the match values or arrival times.\n  Our main contribution is a 1/4-competitive algorithm. The algorithm randomly selects a subset of agents who will wait until r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01285","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-18T00:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"slgSyHV/ahBghhVupRAovB5ld9/qlabojZYCR9ff2ThFMbmzFbFf/P8X0GRemKwYrjAyVR4wDuflyG7O47vFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:54:02.035587Z"},"content_sha256":"976b7048a71525a1b5819b6b6d4bbf4b366c63ee99d1180d5a1f7e58c60c7e2a","schema_version":"1.0","event_id":"sha256:976b7048a71525a1b5819b6b6d4bbf4b366c63ee99d1180d5a1f7e58c60c7e2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4/bundle.json","state_url":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QACLVWG2N6N6F7OFF5V33UGID4/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-05-30T03:54:02Z","links":{"resolver":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4","bundle":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4/bundle.json","state":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QACLVWG2N6N6F7OFF5V33UGID4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QACLVWG2N6N6F7OFF5V33UGID4","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":"daac9c38aab43559de89500073be7de7f37de0ee97ca4802dde44ada4cc98cc8","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-04T02:36:15Z","title_canon_sha256":"6201ceed667eebd83545a3d1883e3ee9fb500356f592d33c1477e882021984f8"},"schema_version":"1.0","source":{"id":"1803.01285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01285","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01285v1","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01285","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"QACLVWG2N6N6","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QACLVWG2N6N6F7OF","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QACLVWG2","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:976b7048a71525a1b5819b6b6d4bbf4b366c63ee99d1180d5a1f7e58c60c7e2a","target":"graph","created_at":"2026-05-18T00:22:01Z","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 study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and the planner's goal is to maximize the total value over a finite time horizon. We study matching algorithms that perform well over any sequence of arrivals when there is no a priori information about the match values or arrival times.\n  Our main contribution is a 1/4-competitive algorithm. The algorithm randomly selects a subset of agents who will wait until r","authors_text":"Amin Saberi, Itai Ashlagi, Maximilien Burq, Patrick Jaillet","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-04T02:36:15Z","title":"Maximizing Efficiency in Dynamic Matching Markets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01285","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:781b0191fd448f357cf47d3b438c6ec9a1e325edf15f3be0c4d6680096afe170","target":"record","created_at":"2026-05-18T00:22:01Z","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":"daac9c38aab43559de89500073be7de7f37de0ee97ca4802dde44ada4cc98cc8","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-04T02:36:15Z","title_canon_sha256":"6201ceed667eebd83545a3d1883e3ee9fb500356f592d33c1477e882021984f8"},"schema_version":"1.0","source":{"id":"1803.01285","kind":"arxiv","version":1}},"canonical_sha256":"8004bad8da6f9be2fdc52f6bbdd0c81f12ea69f7963f852a66cdcff34cc69e17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8004bad8da6f9be2fdc52f6bbdd0c81f12ea69f7963f852a66cdcff34cc69e17","first_computed_at":"2026-05-18T00:22:01.182133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:01.182133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1d7IbFF8/vR3iYOxnkh5+ojsArResOvqaYvAQzRK+TCR/dOd5YaBpACgpFZgORXiUvUCdZhEDH7O3Bio0OWrDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:01.182747Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:781b0191fd448f357cf47d3b438c6ec9a1e325edf15f3be0c4d6680096afe170","sha256:976b7048a71525a1b5819b6b6d4bbf4b366c63ee99d1180d5a1f7e58c60c7e2a"],"state_sha256":"ba58021b5e495c0098632e7e62e131589fc3dde27126767c8b2254369b6a6d4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRxpciKTD4ZgqxuV59Yp6R71x4hGNa1bBqM8332oLr/XT6ySKcrqpBCJvyatMU6dU6kkBBia4UtgYjMa3pCMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:54:02.038814Z","bundle_sha256":"744a33f4457aee89777e3e0253627a4ea1e1fb72ef3eb91e7ed6e846abc7e0a7"}}