{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Z4RRLVEFOX3XBVDUCV4RPORAMN","short_pith_number":"pith:Z4RRLVEF","schema_version":"1.0","canonical_sha256":"cf2315d48575f770d474157917ba2063760934a7f09aab7a3bd7e6b392aee300","source":{"kind":"arxiv","id":"1902.08930","version":1},"attestation_state":"computed","paper":{"title":"Testing Preferential Domains Using Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.GT","authors_text":"Garima Shakya, Palash Dey, Swaprava Nath","submitted_at":"2019-02-24T11:42:13Z","abstract_excerpt":"A preferential domain is a collection of sets of preferences which are linear orders over a set of alternatives. These domains have been studied extensively in social choice theory due to both its practical importance and theoretical elegance. Examples of some extensively studied preferential domains include single peaked, single crossing, Euclidean, etc. In this paper, we study the sample complexity of testing whether a given preference profile is close to some specific domain. We consider two notions of closeness: (a) closeness via preferences, and (b) closeness via alternatives. We further "},"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":"1902.08930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-24T11:42:13Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"c3b2758615ad0f6061c5b978662da6e50d64472c5779bc11e6f4892024b5b283","abstract_canon_sha256":"1d9f491807f81ba7e3bcf64a8ac08610157b97b29e8b7c56fa9e61ec343fea8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:49.387944Z","signature_b64":"JnKa+cBNvbugHkVlFSKmEd1JOo8vkStOyHYuiHdj78fMCZS94a13ATNFg4u47cpwgzpCHqkBJjy1DbTjjJ8RBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf2315d48575f770d474157917ba2063760934a7f09aab7a3bd7e6b392aee300","last_reissued_at":"2026-05-17T23:52:49.387259Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:49.387259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing Preferential Domains Using Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.GT","authors_text":"Garima Shakya, Palash Dey, Swaprava Nath","submitted_at":"2019-02-24T11:42:13Z","abstract_excerpt":"A preferential domain is a collection of sets of preferences which are linear orders over a set of alternatives. These domains have been studied extensively in social choice theory due to both its practical importance and theoretical elegance. Examples of some extensively studied preferential domains include single peaked, single crossing, Euclidean, etc. In this paper, we study the sample complexity of testing whether a given preference profile is close to some specific domain. We consider two notions of closeness: (a) closeness via preferences, and (b) closeness via alternatives. We further "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08930","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":"1902.08930","created_at":"2026-05-17T23:52:49.387377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08930v1","created_at":"2026-05-17T23:52:49.387377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08930","created_at":"2026-05-17T23:52:49.387377+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z4RRLVEFOX3X","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z4RRLVEFOX3XBVDU","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z4RRLVEF","created_at":"2026-05-18T12:33:33.725879+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/Z4RRLVEFOX3XBVDUCV4RPORAMN","json":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN.json","graph_json":"https://pith.science/api/pith-number/Z4RRLVEFOX3XBVDUCV4RPORAMN/graph.json","events_json":"https://pith.science/api/pith-number/Z4RRLVEFOX3XBVDUCV4RPORAMN/events.json","paper":"https://pith.science/paper/Z4RRLVEF"},"agent_actions":{"view_html":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN","download_json":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN.json","view_paper":"https://pith.science/paper/Z4RRLVEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08930&json=true","fetch_graph":"https://pith.science/api/pith-number/Z4RRLVEFOX3XBVDUCV4RPORAMN/graph.json","fetch_events":"https://pith.science/api/pith-number/Z4RRLVEFOX3XBVDUCV4RPORAMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN/action/storage_attestation","attest_author":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN/action/author_attestation","sign_citation":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN/action/citation_signature","submit_replication":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN/action/replication_record"}},"created_at":"2026-05-17T23:52:49.387377+00:00","updated_at":"2026-05-17T23:52:49.387377+00:00"}