{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4KMLWSKJYRMWFH3M5ZYIOHJ6BY","short_pith_number":"pith:4KMLWSKJ","canonical_record":{"source":{"id":"2501.08775","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-15T12:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"44ee0aa0e9128e431ec934a0f27548e13713d99e244f9b9e717f3e16fb46f47d","abstract_canon_sha256":"439e9ed03d5ab235f31ed5bcabd9a98965e4ea81117ea35d915091bd9a754099"},"schema_version":"1.0"},"canonical_sha256":"e298bb4949c459629f6cee70871d3e0e2b0f67307c373f2c62539a0626238258","source":{"kind":"arxiv","id":"2501.08775","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.08775","created_at":"2026-07-05T11:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"2501.08775v2","created_at":"2026-07-05T11:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08775","created_at":"2026-07-05T11:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"4KMLWSKJYRMW","created_at":"2026-07-05T11:14:02Z"},{"alias_kind":"pith_short_16","alias_value":"4KMLWSKJYRMWFH3M","created_at":"2026-07-05T11:14:02Z"},{"alias_kind":"pith_short_8","alias_value":"4KMLWSKJ","created_at":"2026-07-05T11:14:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4KMLWSKJYRMWFH3M5ZYIOHJ6BY","target":"record","payload":{"canonical_record":{"source":{"id":"2501.08775","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-15T12:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"44ee0aa0e9128e431ec934a0f27548e13713d99e244f9b9e717f3e16fb46f47d","abstract_canon_sha256":"439e9ed03d5ab235f31ed5bcabd9a98965e4ea81117ea35d915091bd9a754099"},"schema_version":"1.0"},"canonical_sha256":"e298bb4949c459629f6cee70871d3e0e2b0f67307c373f2c62539a0626238258","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:02.213744Z","signature_b64":"HGtRFxgIl/MFWBxm+D8oDJLfK8vwcFJFCZnJqbr+2cKjF7gtkHuo3S9gkPH/0ikJQqhAi14wa616Bymambv6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e298bb4949c459629f6cee70871d3e0e2b0f67307c373f2c62539a0626238258","last_reissued_at":"2026-07-05T11:14:02.213227Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:02.213227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.08775","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-05T11:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ue7drkTvSXaL3My9pOVd25lbW3loal/H2JC9LZkemagtZMxt9eS4ljWClZ2NUBiPU+ltR5wegtfGEsFS9+n2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:39:37.364769Z"},"content_sha256":"6fad4666f928932b8a924124ed5636e865219008fcba1f0eda3f1ee4cc02bd6d","schema_version":"1.0","event_id":"sha256:6fad4666f928932b8a924124ed5636e865219008fcba1f0eda3f1ee4cc02bd6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4KMLWSKJYRMWFH3M5ZYIOHJ6BY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Approximation Schemes for Matching Queues","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Aouad, Alireza Amanihamedani, Amin Saberi","submitted_at":"2025-01-15T12:56:38Z","abstract_excerpt":"We study a continuous-time, infinite-horizon dynamic bipartite matching problem. Suppliers arrive according to a Poisson process; while waiting, they may abandon the queue at a uniform rate. Customers on the other hand must be matched upon arrival. The objective is to minimize the expected long-term average cost subject to a throughput constraint on the total match rate.\n  Previous literature on dynamic matching focuses on \"static\" policies, where the matching decisions do not depend explicitly on the state of the supplier queues, achieving constant-factor approximations. By contrast, we desig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08775","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/2501.08775/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-05T11:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2MNjwQkClA5iiqwL2d+z9UbUEUwFf//tnXQ/wDV4d7LkQt22buIcEvQdKTXI0BHEsM9mTf2L/IqNtpfAWvACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:39:37.365642Z"},"content_sha256":"2f3fa15d78ca78b4e66eebbd705da39950702428c49351241675e5a3bffac514","schema_version":"1.0","event_id":"sha256:2f3fa15d78ca78b4e66eebbd705da39950702428c49351241675e5a3bffac514"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/bundle.json","state_url":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/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-13T06:39:37Z","links":{"resolver":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY","bundle":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/bundle.json","state":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4KMLWSKJYRMWFH3M5ZYIOHJ6BY","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":"439e9ed03d5ab235f31ed5bcabd9a98965e4ea81117ea35d915091bd9a754099","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-15T12:56:38Z","title_canon_sha256":"44ee0aa0e9128e431ec934a0f27548e13713d99e244f9b9e717f3e16fb46f47d"},"schema_version":"1.0","source":{"id":"2501.08775","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.08775","created_at":"2026-07-05T11:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"2501.08775v2","created_at":"2026-07-05T11:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08775","created_at":"2026-07-05T11:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"4KMLWSKJYRMW","created_at":"2026-07-05T11:14:02Z"},{"alias_kind":"pith_short_16","alias_value":"4KMLWSKJYRMWFH3M","created_at":"2026-07-05T11:14:02Z"},{"alias_kind":"pith_short_8","alias_value":"4KMLWSKJ","created_at":"2026-07-05T11:14:02Z"}],"graph_snapshots":[{"event_id":"sha256:2f3fa15d78ca78b4e66eebbd705da39950702428c49351241675e5a3bffac514","target":"graph","created_at":"2026-07-05T11:14:02Z","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/2501.08775/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a continuous-time, infinite-horizon dynamic bipartite matching problem. Suppliers arrive according to a Poisson process; while waiting, they may abandon the queue at a uniform rate. Customers on the other hand must be matched upon arrival. The objective is to minimize the expected long-term average cost subject to a throughput constraint on the total match rate.\n  Previous literature on dynamic matching focuses on \"static\" policies, where the matching decisions do not depend explicitly on the state of the supplier queues, achieving constant-factor approximations. By contrast, we desig","authors_text":"Ali Aouad, Alireza Amanihamedani, Amin Saberi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-15T12:56:38Z","title":"Adaptive Approximation Schemes for Matching Queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08775","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:6fad4666f928932b8a924124ed5636e865219008fcba1f0eda3f1ee4cc02bd6d","target":"record","created_at":"2026-07-05T11:14:02Z","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":"439e9ed03d5ab235f31ed5bcabd9a98965e4ea81117ea35d915091bd9a754099","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-15T12:56:38Z","title_canon_sha256":"44ee0aa0e9128e431ec934a0f27548e13713d99e244f9b9e717f3e16fb46f47d"},"schema_version":"1.0","source":{"id":"2501.08775","kind":"arxiv","version":2}},"canonical_sha256":"e298bb4949c459629f6cee70871d3e0e2b0f67307c373f2c62539a0626238258","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e298bb4949c459629f6cee70871d3e0e2b0f67307c373f2c62539a0626238258","first_computed_at":"2026-07-05T11:14:02.213227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:02.213227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HGtRFxgIl/MFWBxm+D8oDJLfK8vwcFJFCZnJqbr+2cKjF7gtkHuo3S9gkPH/0ikJQqhAi14wa616Bymambv6CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:02.213744Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.08775","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fad4666f928932b8a924124ed5636e865219008fcba1f0eda3f1ee4cc02bd6d","sha256:2f3fa15d78ca78b4e66eebbd705da39950702428c49351241675e5a3bffac514"],"state_sha256":"8a12ef3ddcd3c97583e26972b0fa8909f5e5af88b350fa4f8c7d955cdccc2e33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8sZxV3nTa+dT9T61XPfd/NivwrjE1S/d5FaH3t8r7ci2GaYkVHrbShm09kyx/DuDOmKlrIMdflVOhIS1kqRlAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T06:39:37.369701Z","bundle_sha256":"4797a7b430b7089f3870a0ecef36f2eb330a29fbe5721c7c36d785d8a4ebe43e"}}