{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SN7X5MNVYOJCIOU4XF5CDGVZUW","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":"8b88dd242cf29b2f8620a5a9c84da36a4fbc129fa01a450ed4602a2b5049fb9e","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GT","submitted_at":"2020-06-08T01:38:21Z","title_canon_sha256":"d9612a6c6852fe80c60380d699f49b15bb8ef954ce2cde1a797de170b07a0ef5"},"schema_version":"1.0","source":{"id":"2006.04313","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.04313","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"2006.04313v4","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.04313","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"SN7X5MNVYOJC","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"pith_short_16","alias_value":"SN7X5MNVYOJCIOU4","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"pith_short_8","alias_value":"SN7X5MNV","created_at":"2026-07-05T06:52:18Z"}],"graph_snapshots":[{"event_id":"sha256:76236aa0e3eb78376c26c379a17e5bb245388ab3303f53c812c3d6e09afd253a","target":"graph","created_at":"2026-07-05T06:52:18Z","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/2006.04313/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we study the multi-agent assortment optimization problem in the two-sided sequential matching model introduced by Ashlagi et al. (2022). The setting is the following: we (the platform) offer a menu of suppliers to each customer. Then, every customer selects, simultaneously and independently, to match with a supplier or to remain unmatched. Each supplier observes the subset of customers that selected them, and choose either to match a customer or to leave the system. Therefore, a match takes place if both a customer and a supplier sequentially select each other. Each agent's behav","authors_text":"Alfredo Torrico, Andrea Lodi, Margarida Carvalho","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GT","submitted_at":"2020-06-08T01:38:21Z","title":"Multi-agent Assortment Optimization in Sequential Matching Markets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.04313","kind":"arxiv","version":4},"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:824bf617634f2d0feb33f1f2d0710f63ac106b65cd5bd6de5ea022719ab661eb","target":"record","created_at":"2026-07-05T06:52:18Z","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":"8b88dd242cf29b2f8620a5a9c84da36a4fbc129fa01a450ed4602a2b5049fb9e","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GT","submitted_at":"2020-06-08T01:38:21Z","title_canon_sha256":"d9612a6c6852fe80c60380d699f49b15bb8ef954ce2cde1a797de170b07a0ef5"},"schema_version":"1.0","source":{"id":"2006.04313","kind":"arxiv","version":4}},"canonical_sha256":"937f7eb1b5c392243a9cb97a219ab9a58a24e22c65a3dd795ba56653403ee182","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"937f7eb1b5c392243a9cb97a219ab9a58a24e22c65a3dd795ba56653403ee182","first_computed_at":"2026-07-05T06:52:18.096182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:52:18.096182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eo45oH4CSBazz4Nxg8dvt5JNvc93llgq3WzfEKZ33nZpZaZtW/TKHzxkvQQF1btr5YMU3iH5Tr3qcOTGfWYzAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:52:18.096655Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.04313","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:824bf617634f2d0feb33f1f2d0710f63ac106b65cd5bd6de5ea022719ab661eb","sha256:76236aa0e3eb78376c26c379a17e5bb245388ab3303f53c812c3d6e09afd253a"],"state_sha256":"c6ca04f1756381ab0602afc0e924c7ae1456d68a85be0f6e3f7466565ea13240"}