{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JFUFIY7B6YIGZ3GPB4YRKDQNQB","short_pith_number":"pith:JFUFIY7B","schema_version":"1.0","canonical_sha256":"49685463e1f6106ceccf0f31150e0d806ab7ced914b771910bd70b7249e8a5f0","source":{"kind":"arxiv","id":"2404.18133","version":2},"attestation_state":"computed","paper":{"title":"Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Biaoshuai Tao, Jiaxin Song, Shengxin Liu, Xiaolin Bu, Zihao Li","submitted_at":"2024-04-28T10:04:47Z","abstract_excerpt":"We study the problem of fairly allocating $m$ indivisible goods to $n$ agents, where agents may have different preferences over the goods. In the traditional setting, agents' valuations are provided as inputs to the algorithm. In this paper, we adopt the query model, which has been widely considered for other similar problems (such as matching [Nis21], graph isomorphism [OS18], and equilibrium in game [Bab16]), and apply it to the fair division problem. In particular, we consider a new \\emph{comparison-based query model}, where the algorithm presents two bundles of goods to an agent and the ag"},"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":"2404.18133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-04-28T10:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"0becf8493d5b84d4b7de242c5427d35376822f946e52275b9acbca70542e367f","abstract_canon_sha256":"675c00a1279ff58c8561a9bdbb51503e3940e371a322745785e0e970688eda50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:11.618075Z","signature_b64":"HkcoT86IALvStloAsRPbfBNamdgFEo502fvPHn/zeFH38d7se3a1hZbKhhE8y3nwitZglcY/wXRooM8c8qgDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49685463e1f6106ceccf0f31150e0d806ab7ced914b771910bd70b7249e8a5f0","last_reissued_at":"2026-07-05T11:47:11.617387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:11.617387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Biaoshuai Tao, Jiaxin Song, Shengxin Liu, Xiaolin Bu, Zihao Li","submitted_at":"2024-04-28T10:04:47Z","abstract_excerpt":"We study the problem of fairly allocating $m$ indivisible goods to $n$ agents, where agents may have different preferences over the goods. In the traditional setting, agents' valuations are provided as inputs to the algorithm. In this paper, we adopt the query model, which has been widely considered for other similar problems (such as matching [Nis21], graph isomorphism [OS18], and equilibrium in game [Bab16]), and apply it to the fair division problem. In particular, we consider a new \\emph{comparison-based query model}, where the algorithm presents two bundles of goods to an agent and the ag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.18133","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/2404.18133/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":"2404.18133","created_at":"2026-07-05T11:47:11.617468+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.18133v2","created_at":"2026-07-05T11:47:11.617468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.18133","created_at":"2026-07-05T11:47:11.617468+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFUFIY7B6YIG","created_at":"2026-07-05T11:47:11.617468+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFUFIY7B6YIGZ3GP","created_at":"2026-07-05T11:47:11.617468+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFUFIY7B","created_at":"2026-07-05T11:47:11.617468+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/JFUFIY7B6YIGZ3GPB4YRKDQNQB","json":"https://pith.science/pith/JFUFIY7B6YIGZ3GPB4YRKDQNQB.json","graph_json":"https://pith.science/api/pith-number/JFUFIY7B6YIGZ3GPB4YRKDQNQB/graph.json","events_json":"https://pith.science/api/pith-number/JFUFIY7B6YIGZ3GPB4YRKDQNQB/events.json","paper":"https://pith.science/paper/JFUFIY7B"},"agent_actions":{"view_html":"https://pith.science/pith/JFUFIY7B6YIGZ3GPB4YRKDQNQB","download_json":"https://pith.science/pith/JFUFIY7B6YIGZ3GPB4YRKDQNQB.json","view_paper":"https://pith.science/paper/JFUFIY7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.18133&json=true","fetch_graph":"https://pith.science/api/pith-number/JFUFIY7B6YIGZ3GPB4YRKDQNQB/graph.json","fetch_events":"https://pith.science/api/pith-number/JFUFIY7B6YIGZ3GPB4YRKDQNQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFUFIY7B6YIGZ3GPB4YRKDQNQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFUFIY7B6YIGZ3GPB4YRKDQNQB/action/storage_attestation","attest_author":"https://pith.science/pith/JFUFIY7B6YIGZ3GPB4YRKDQNQB/action/author_attestation","sign_citation":"https://pith.science/pith/JFUFIY7B6YIGZ3GPB4YRKDQNQB/action/citation_signature","submit_replication":"https://pith.science/pith/JFUFIY7B6YIGZ3GPB4YRKDQNQB/action/replication_record"}},"created_at":"2026-07-05T11:47:11.617468+00:00","updated_at":"2026-07-05T11:47:11.617468+00:00"}