{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PQSTKKOOVX7YDV66SMZ5J35WV4","short_pith_number":"pith:PQSTKKOO","schema_version":"1.0","canonical_sha256":"7c253529ceadff81d7de9333d4efb6af1731e7ad3e521af112bc095681604a1a","source":{"kind":"arxiv","id":"1206.4366","version":4},"attestation_state":"computed","paper":{"title":"Allocation of Divisible Goods under Lexicographic Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Leonard J. Schulman, Vijay V. Vazirani","submitted_at":"2012-06-20T01:05:11Z","abstract_excerpt":"We present a simple and natural non-pricing mechanism for allocating divisible goods among strategic agents having lexicographic preferences. Our mechanism has favorable properties of incentive compatibility (strategy-proofness), Pareto efficiency, envy-freeness, and time efficiency."},"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":"1206.4366","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-06-20T01:05:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c5f995d241d9cc00e14e5b677b94c452d8daf277b49911d40adbba5a061db9f7","abstract_canon_sha256":"167ab77b9a92039e1960806ae13f7a0961cd1746a86360515f5273876a83d2cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:40.755830Z","signature_b64":"Rk1uU5QblFpxsq4kP+dVUJyIPEEuSCgx7RxBlNdt98K64FNHASBVvFogDWNruUzetcXl1rAdRd+bD0kVZKZ/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c253529ceadff81d7de9333d4efb6af1731e7ad3e521af112bc095681604a1a","last_reissued_at":"2026-05-18T00:50:40.755010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:40.755010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Allocation of Divisible Goods under Lexicographic Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Leonard J. Schulman, Vijay V. Vazirani","submitted_at":"2012-06-20T01:05:11Z","abstract_excerpt":"We present a simple and natural non-pricing mechanism for allocating divisible goods among strategic agents having lexicographic preferences. Our mechanism has favorable properties of incentive compatibility (strategy-proofness), Pareto efficiency, envy-freeness, and time efficiency."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4366","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1206.4366","created_at":"2026-05-18T00:50:40.755130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.4366v4","created_at":"2026-05-18T00:50:40.755130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4366","created_at":"2026-05-18T00:50:40.755130+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQSTKKOOVX7Y","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQSTKKOOVX7YDV66","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQSTKKOO","created_at":"2026-05-18T12:27:18.751474+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/PQSTKKOOVX7YDV66SMZ5J35WV4","json":"https://pith.science/pith/PQSTKKOOVX7YDV66SMZ5J35WV4.json","graph_json":"https://pith.science/api/pith-number/PQSTKKOOVX7YDV66SMZ5J35WV4/graph.json","events_json":"https://pith.science/api/pith-number/PQSTKKOOVX7YDV66SMZ5J35WV4/events.json","paper":"https://pith.science/paper/PQSTKKOO"},"agent_actions":{"view_html":"https://pith.science/pith/PQSTKKOOVX7YDV66SMZ5J35WV4","download_json":"https://pith.science/pith/PQSTKKOOVX7YDV66SMZ5J35WV4.json","view_paper":"https://pith.science/paper/PQSTKKOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.4366&json=true","fetch_graph":"https://pith.science/api/pith-number/PQSTKKOOVX7YDV66SMZ5J35WV4/graph.json","fetch_events":"https://pith.science/api/pith-number/PQSTKKOOVX7YDV66SMZ5J35WV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQSTKKOOVX7YDV66SMZ5J35WV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQSTKKOOVX7YDV66SMZ5J35WV4/action/storage_attestation","attest_author":"https://pith.science/pith/PQSTKKOOVX7YDV66SMZ5J35WV4/action/author_attestation","sign_citation":"https://pith.science/pith/PQSTKKOOVX7YDV66SMZ5J35WV4/action/citation_signature","submit_replication":"https://pith.science/pith/PQSTKKOOVX7YDV66SMZ5J35WV4/action/replication_record"}},"created_at":"2026-05-18T00:50:40.755130+00:00","updated_at":"2026-05-18T00:50:40.755130+00:00"}