{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Q2K5TO7BJKZYZR237UVGGEOY5N","short_pith_number":"pith:Q2K5TO7B","schema_version":"1.0","canonical_sha256":"8695d9bbe14ab38cc75bfd2a6311d8eb7df69fd89aa7aaa0220b232be4028b54","source":{"kind":"arxiv","id":"2607.28925","version":1},"attestation_state":"computed","paper":{"title":"Learning Optimal Dynamic Matching via Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","econ.TH"],"primary_cat":"cs.LG","authors_text":"Akira Matsushita, Genta Okada, Junpei Komiyama, Shunya Noda","submitted_at":"2026-07-31T01:00:25Z","abstract_excerpt":"Dynamic matching markets require decisions about whom to match and when: matching now yields value but removes participants who may create better future opportunities. We develop a value-based reinforcement-learning framework for this problem on finite, evolving weighted graphs. We study an infinite-horizon continuous-time model with stochastic arrivals, node-type transitions, edge realizations, and exogenous exits. We prove an event-time reduction: without loss of optimality, the planner acts immediately after each exogenous event and then waits for the next one. We further show that the opti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.28925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-31T01:00:25Z","cross_cats_sorted":["cs.GT","econ.TH"],"title_canon_sha256":"2d944ab9b954fe645de0896d553173a47051349bc60e50a614046901d66f3f39","abstract_canon_sha256":"88cf4430add426aea9e817a59d93fc14ac1e27fdd8eee996b756e94f010521d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:17:30.907777Z","signature_b64":"obvAgiRkvt2JBipRqzg3vbElJxGf8N6J3FQ9CTWNNRFAvJ7VBp6JDS4A1eFCaj0uPleEotCBKmi/ezIh8lRtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8695d9bbe14ab38cc75bfd2a6311d8eb7df69fd89aa7aaa0220b232be4028b54","last_reissued_at":"2026-08-03T01:17:30.906220Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:17:30.906220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Optimal Dynamic Matching via Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","econ.TH"],"primary_cat":"cs.LG","authors_text":"Akira Matsushita, Genta Okada, Junpei Komiyama, Shunya Noda","submitted_at":"2026-07-31T01:00:25Z","abstract_excerpt":"Dynamic matching markets require decisions about whom to match and when: matching now yields value but removes participants who may create better future opportunities. We develop a value-based reinforcement-learning framework for this problem on finite, evolving weighted graphs. We study an infinite-horizon continuous-time model with stochastic arrivals, node-type transitions, edge realizations, and exogenous exits. We prove an event-time reduction: without loss of optimality, the planner acts immediately after each exogenous event and then waits for the next one. We further show that the opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28925","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/2607.28925/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.28925","created_at":"2026-08-03T01:17:30.907134+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28925v1","created_at":"2026-08-03T01:17:30.907134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28925","created_at":"2026-08-03T01:17:30.907134+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2K5TO7BJKZY","created_at":"2026-08-03T01:17:30.907134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2K5TO7BJKZYZR23","created_at":"2026-08-03T01:17:30.907134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2K5TO7B","created_at":"2026-08-03T01:17:30.907134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q2K5TO7BJKZYZR237UVGGEOY5N","json":"https://pith.science/pith/Q2K5TO7BJKZYZR237UVGGEOY5N.json","graph_json":"https://pith.science/api/pith-number/Q2K5TO7BJKZYZR237UVGGEOY5N/graph.json","events_json":"https://pith.science/api/pith-number/Q2K5TO7BJKZYZR237UVGGEOY5N/events.json","paper":"https://pith.science/paper/Q2K5TO7B"},"agent_actions":{"view_html":"https://pith.science/pith/Q2K5TO7BJKZYZR237UVGGEOY5N","download_json":"https://pith.science/pith/Q2K5TO7BJKZYZR237UVGGEOY5N.json","view_paper":"https://pith.science/paper/Q2K5TO7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28925&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2K5TO7BJKZYZR237UVGGEOY5N/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2K5TO7BJKZYZR237UVGGEOY5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2K5TO7BJKZYZR237UVGGEOY5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2K5TO7BJKZYZR237UVGGEOY5N/action/storage_attestation","attest_author":"https://pith.science/pith/Q2K5TO7BJKZYZR237UVGGEOY5N/action/author_attestation","sign_citation":"https://pith.science/pith/Q2K5TO7BJKZYZR237UVGGEOY5N/action/citation_signature","submit_replication":"https://pith.science/pith/Q2K5TO7BJKZYZR237UVGGEOY5N/action/replication_record"}},"created_at":"2026-08-03T01:17:30.907134+00:00","updated_at":"2026-08-03T01:17:30.907134+00:00"}