{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RZ5FKZOWI4HMDIIDHM75JXY6LA","short_pith_number":"pith:RZ5FKZOW","schema_version":"1.0","canonical_sha256":"8e7a5565d6470ec1a1033b3fd4df1e58276dc56f95ca7fc5ea83a6deba715262","source":{"kind":"arxiv","id":"1504.07687","version":1},"attestation_state":"computed","paper":{"title":"Public projects, Boolean functions and the borders of Border's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Noam Nisan, Parikshit Gopalan, Tim Roughgarden","submitted_at":"2015-04-29T00:24:39Z","abstract_excerpt":"Border's theorem gives an intuitive linear characterization of the feasible interim allocation rules of a Bayesian single-item environment, and it has several applications in economic and algorithmic mechanism design. All known generalizations of Border's theorem either restrict attention to relatively simple settings, or resort to approximation. This paper identifies a complexity-theoretic barrier that indicates, assuming standard complexity class separations, that Border's theorem cannot be extended significantly beyond the state-of-the-art. We also identify a surprisingly tight connection b"},"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":"1504.07687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-04-29T00:24:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"56ee9608837e4709380e74bc90e9a0a041aa6bc12bead7ae618af0a006d1f0ca","abstract_canon_sha256":"78c965622807a278ad2160cc665708e4cd88e140302c37215142e5c15d0ad8ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:32.565916Z","signature_b64":"3z73utiZMTVGUnRvzU6e4Mdq2AThcxHbswcLDGkuFoo8WXp1/GCW8tmMgnGaJV67wQKjakyUWV4Nz5KXC6rhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e7a5565d6470ec1a1033b3fd4df1e58276dc56f95ca7fc5ea83a6deba715262","last_reissued_at":"2026-05-18T02:17:32.565168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:32.565168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Public projects, Boolean functions and the borders of Border's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Noam Nisan, Parikshit Gopalan, Tim Roughgarden","submitted_at":"2015-04-29T00:24:39Z","abstract_excerpt":"Border's theorem gives an intuitive linear characterization of the feasible interim allocation rules of a Bayesian single-item environment, and it has several applications in economic and algorithmic mechanism design. All known generalizations of Border's theorem either restrict attention to relatively simple settings, or resort to approximation. This paper identifies a complexity-theoretic barrier that indicates, assuming standard complexity class separations, that Border's theorem cannot be extended significantly beyond the state-of-the-art. We also identify a surprisingly tight connection b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07687","kind":"arxiv","version":1},"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":"1504.07687","created_at":"2026-05-18T02:17:32.565311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07687v1","created_at":"2026-05-18T02:17:32.565311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07687","created_at":"2026-05-18T02:17:32.565311+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZ5FKZOWI4HM","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZ5FKZOWI4HMDIID","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZ5FKZOW","created_at":"2026-05-18T12:29:39.896362+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/RZ5FKZOWI4HMDIIDHM75JXY6LA","json":"https://pith.science/pith/RZ5FKZOWI4HMDIIDHM75JXY6LA.json","graph_json":"https://pith.science/api/pith-number/RZ5FKZOWI4HMDIIDHM75JXY6LA/graph.json","events_json":"https://pith.science/api/pith-number/RZ5FKZOWI4HMDIIDHM75JXY6LA/events.json","paper":"https://pith.science/paper/RZ5FKZOW"},"agent_actions":{"view_html":"https://pith.science/pith/RZ5FKZOWI4HMDIIDHM75JXY6LA","download_json":"https://pith.science/pith/RZ5FKZOWI4HMDIIDHM75JXY6LA.json","view_paper":"https://pith.science/paper/RZ5FKZOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07687&json=true","fetch_graph":"https://pith.science/api/pith-number/RZ5FKZOWI4HMDIIDHM75JXY6LA/graph.json","fetch_events":"https://pith.science/api/pith-number/RZ5FKZOWI4HMDIIDHM75JXY6LA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZ5FKZOWI4HMDIIDHM75JXY6LA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZ5FKZOWI4HMDIIDHM75JXY6LA/action/storage_attestation","attest_author":"https://pith.science/pith/RZ5FKZOWI4HMDIIDHM75JXY6LA/action/author_attestation","sign_citation":"https://pith.science/pith/RZ5FKZOWI4HMDIIDHM75JXY6LA/action/citation_signature","submit_replication":"https://pith.science/pith/RZ5FKZOWI4HMDIIDHM75JXY6LA/action/replication_record"}},"created_at":"2026-05-18T02:17:32.565311+00:00","updated_at":"2026-05-18T02:17:32.565311+00:00"}