{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MMQA3DCINBKGLBZVNRDKT2OGBI","short_pith_number":"pith:MMQA3DCI","schema_version":"1.0","canonical_sha256":"63200d8c4868546587356c46a9e9c60a2e91bd5293d88065a89a8c4a0a4dcf02","source":{"kind":"arxiv","id":"2302.09757","version":2},"attestation_state":"computed","paper":{"title":"An ODE Model for Dynamic Matching in Heterogeneous Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hengzhi He, Xiaowu Dai","submitted_at":"2023-02-20T04:45:13Z","abstract_excerpt":"We study the problem of dynamic matching in heterogeneous networks, where agents are subject to compatibility restrictions and stochastic arrival and departure times. In particular, we consider networks with one type of easy-to-match agents and multiple types of hard-to-match agents, each subject to its own compatibility constraints. Such a setting arises in many real-world applications, including kidney exchange programs and carpooling platforms. We introduce a novel approach to modeling dynamic matching by establishing the ordinary differential equation (ODE) model, which offers a new perspe"},"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":"2302.09757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-20T04:45:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c35e14adfee4f537c1ac6117bd1be915c7e82a9e58a3b44ae1a7128c75d6446e","abstract_canon_sha256":"0441e28b21fed7f6f11ed66c0d062a7a5050d106a7d4e34e3ea542073a0f9d99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:17.762033Z","signature_b64":"Oty7LHvrV77kjKxdlFg98kK8LvCpb4lyfmBmy48bDHMlcGdDKsxVGxMBjN+hwnAoIJ0U8N8/nv9YRl/b56alAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63200d8c4868546587356c46a9e9c60a2e91bd5293d88065a89a8c4a0a4dcf02","last_reissued_at":"2026-07-05T05:49:17.761465Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:17.761465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An ODE Model for Dynamic Matching in Heterogeneous Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hengzhi He, Xiaowu Dai","submitted_at":"2023-02-20T04:45:13Z","abstract_excerpt":"We study the problem of dynamic matching in heterogeneous networks, where agents are subject to compatibility restrictions and stochastic arrival and departure times. In particular, we consider networks with one type of easy-to-match agents and multiple types of hard-to-match agents, each subject to its own compatibility constraints. Such a setting arises in many real-world applications, including kidney exchange programs and carpooling platforms. We introduce a novel approach to modeling dynamic matching by establishing the ordinary differential equation (ODE) model, which offers a new perspe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.09757","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/2302.09757/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":"2302.09757","created_at":"2026-07-05T05:49:17.761539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.09757v2","created_at":"2026-07-05T05:49:17.761539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.09757","created_at":"2026-07-05T05:49:17.761539+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMQA3DCINBKG","created_at":"2026-07-05T05:49:17.761539+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMQA3DCINBKGLBZV","created_at":"2026-07-05T05:49:17.761539+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMQA3DCI","created_at":"2026-07-05T05:49:17.761539+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/MMQA3DCINBKGLBZVNRDKT2OGBI","json":"https://pith.science/pith/MMQA3DCINBKGLBZVNRDKT2OGBI.json","graph_json":"https://pith.science/api/pith-number/MMQA3DCINBKGLBZVNRDKT2OGBI/graph.json","events_json":"https://pith.science/api/pith-number/MMQA3DCINBKGLBZVNRDKT2OGBI/events.json","paper":"https://pith.science/paper/MMQA3DCI"},"agent_actions":{"view_html":"https://pith.science/pith/MMQA3DCINBKGLBZVNRDKT2OGBI","download_json":"https://pith.science/pith/MMQA3DCINBKGLBZVNRDKT2OGBI.json","view_paper":"https://pith.science/paper/MMQA3DCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.09757&json=true","fetch_graph":"https://pith.science/api/pith-number/MMQA3DCINBKGLBZVNRDKT2OGBI/graph.json","fetch_events":"https://pith.science/api/pith-number/MMQA3DCINBKGLBZVNRDKT2OGBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMQA3DCINBKGLBZVNRDKT2OGBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMQA3DCINBKGLBZVNRDKT2OGBI/action/storage_attestation","attest_author":"https://pith.science/pith/MMQA3DCINBKGLBZVNRDKT2OGBI/action/author_attestation","sign_citation":"https://pith.science/pith/MMQA3DCINBKGLBZVNRDKT2OGBI/action/citation_signature","submit_replication":"https://pith.science/pith/MMQA3DCINBKGLBZVNRDKT2OGBI/action/replication_record"}},"created_at":"2026-07-05T05:49:17.761539+00:00","updated_at":"2026-07-05T05:49:17.761539+00:00"}