{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GXDDQI4F6UVYMCJ724GSGDTHLJ","short_pith_number":"pith:GXDDQI4F","schema_version":"1.0","canonical_sha256":"35c6382385f52b86093fd70d230e675a7f8784d3047b1a8b3db5906a4fd7a0f5","source":{"kind":"arxiv","id":"2410.19384","version":3},"attestation_state":"computed","paper":{"title":"Learning Neural Strategy-Proof Matching Mechanism from Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hisashi Kashima, Koh Takeuchi, Ryota Maruo","submitted_at":"2024-10-25T08:34:25Z","abstract_excerpt":"Designing two-sided matching mechanisms is challenging when practical demands for matching outcomes are difficult to formalize and the designed mechanism must satisfy theoretical conditions. To address this, prior work has proposed a framework that learns a matching mechanism from examples, using a parameterized family that satisfies properties such as stability. However, despite its usefulness, this framework does not guarantee strategy-proofness (SP), and cannot handle varying numbers of agents or incorporate publicly available contextual information about agents, both of which are crucial i"},"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":"2410.19384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-25T08:34:25Z","cross_cats_sorted":[],"title_canon_sha256":"dd0d1a1f39250a6e1aa1380b7d851d8a21d7316881c4d6356d1f22fb790c0b9a","abstract_canon_sha256":"8680c54e94d718fa6322475475690a5c81a9127c86be75f02956e92b3721b9b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:29.505413Z","signature_b64":"u5o7OzDuGIqSNvZM6Wa44xHZu/FLe9ZFWBL/L0g3hYtsi7R6eiQo0T6vigq0Po7UCbfQjoWvn4v/Xoq9DJO/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35c6382385f52b86093fd70d230e675a7f8784d3047b1a8b3db5906a4fd7a0f5","last_reissued_at":"2026-07-05T11:45:29.504827Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:29.504827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Neural Strategy-Proof Matching Mechanism from Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hisashi Kashima, Koh Takeuchi, Ryota Maruo","submitted_at":"2024-10-25T08:34:25Z","abstract_excerpt":"Designing two-sided matching mechanisms is challenging when practical demands for matching outcomes are difficult to formalize and the designed mechanism must satisfy theoretical conditions. To address this, prior work has proposed a framework that learns a matching mechanism from examples, using a parameterized family that satisfies properties such as stability. However, despite its usefulness, this framework does not guarantee strategy-proofness (SP), and cannot handle varying numbers of agents or incorporate publicly available contextual information about agents, both of which are crucial i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.19384","kind":"arxiv","version":3},"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/2410.19384/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":"2410.19384","created_at":"2026-07-05T11:45:29.504954+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.19384v3","created_at":"2026-07-05T11:45:29.504954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.19384","created_at":"2026-07-05T11:45:29.504954+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXDDQI4F6UVY","created_at":"2026-07-05T11:45:29.504954+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXDDQI4F6UVYMCJ7","created_at":"2026-07-05T11:45:29.504954+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXDDQI4F","created_at":"2026-07-05T11:45:29.504954+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/GXDDQI4F6UVYMCJ724GSGDTHLJ","json":"https://pith.science/pith/GXDDQI4F6UVYMCJ724GSGDTHLJ.json","graph_json":"https://pith.science/api/pith-number/GXDDQI4F6UVYMCJ724GSGDTHLJ/graph.json","events_json":"https://pith.science/api/pith-number/GXDDQI4F6UVYMCJ724GSGDTHLJ/events.json","paper":"https://pith.science/paper/GXDDQI4F"},"agent_actions":{"view_html":"https://pith.science/pith/GXDDQI4F6UVYMCJ724GSGDTHLJ","download_json":"https://pith.science/pith/GXDDQI4F6UVYMCJ724GSGDTHLJ.json","view_paper":"https://pith.science/paper/GXDDQI4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.19384&json=true","fetch_graph":"https://pith.science/api/pith-number/GXDDQI4F6UVYMCJ724GSGDTHLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GXDDQI4F6UVYMCJ724GSGDTHLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXDDQI4F6UVYMCJ724GSGDTHLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXDDQI4F6UVYMCJ724GSGDTHLJ/action/storage_attestation","attest_author":"https://pith.science/pith/GXDDQI4F6UVYMCJ724GSGDTHLJ/action/author_attestation","sign_citation":"https://pith.science/pith/GXDDQI4F6UVYMCJ724GSGDTHLJ/action/citation_signature","submit_replication":"https://pith.science/pith/GXDDQI4F6UVYMCJ724GSGDTHLJ/action/replication_record"}},"created_at":"2026-07-05T11:45:29.504954+00:00","updated_at":"2026-07-05T11:45:29.504954+00:00"}