{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Z4RRLVEFOX3XBVDUCV4RPORAMN","short_pith_number":"pith:Z4RRLVEF","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"},"canonical_sha256":"cf2315d48575f770d474157917ba2063760934a7f09aab7a3bd7e6b392aee300","source":{"kind":"arxiv","id":"1902.08930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08930","created_at":"2026-05-17T23:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08930v1","created_at":"2026-05-17T23:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08930","created_at":"2026-05-17T23:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"Z4RRLVEFOX3X","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z4RRLVEFOX3XBVDU","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z4RRLVEF","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Z4RRLVEFOX3XBVDUCV4RPORAMN","target":"record","payload":{"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"},"canonical_sha256":"cf2315d48575f770d474157917ba2063760934a7f09aab7a3bd7e6b392aee300","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"},"source_kind":"arxiv","source_id":"1902.08930","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TclVr2LBGa1OCRBEw1iZ9qUQm0cuPzWoXsilLDdGOXrbUZE4gJdhhtE0mTZCUkhp3Sl1FuEcWetlJaO+0fTnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:15.939178Z"},"content_sha256":"354401256ccff0cf9321a79fe0d46bdba6dd599147d823db94ee82afd3e8185c","schema_version":"1.0","event_id":"sha256:354401256ccff0cf9321a79fe0d46bdba6dd599147d823db94ee82afd3e8185c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Z4RRLVEFOX3XBVDUCV4RPORAMN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtTFqXEhX/P7zkCnhftQ5sNOvS1gz4pA1wXUQwkrpPGwihNjPLqIZ/hp40ADOazYOmvidvq8f9jgB7J0vyn4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:15.939543Z"},"content_sha256":"cfaa6d0983da52e5aff233777022091df1206c3131c2487507e7b71d564c7c23","schema_version":"1.0","event_id":"sha256:cfaa6d0983da52e5aff233777022091df1206c3131c2487507e7b71d564c7c23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN/bundle.json","state_url":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T19:38:15Z","links":{"resolver":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN","bundle":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN/bundle.json","state":"https://pith.science/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4RRLVEFOX3XBVDUCV4RPORAMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Z4RRLVEFOX3XBVDUCV4RPORAMN","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":"1d9f491807f81ba7e3bcf64a8ac08610157b97b29e8b7c56fa9e61ec343fea8e","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-24T11:42:13Z","title_canon_sha256":"c3b2758615ad0f6061c5b978662da6e50d64472c5779bc11e6f4892024b5b283"},"schema_version":"1.0","source":{"id":"1902.08930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08930","created_at":"2026-05-17T23:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08930v1","created_at":"2026-05-17T23:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08930","created_at":"2026-05-17T23:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"Z4RRLVEFOX3X","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z4RRLVEFOX3XBVDU","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z4RRLVEF","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:cfaa6d0983da52e5aff233777022091df1206c3131c2487507e7b71d564c7c23","target":"graph","created_at":"2026-05-17T23:52:49Z","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"},"paper":{"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 ","authors_text":"Garima Shakya, Palash Dey, Swaprava Nath","cross_cats":["cs.AI","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-24T11:42:13Z","title":"Testing Preferential Domains Using Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08930","kind":"arxiv","version":1},"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:354401256ccff0cf9321a79fe0d46bdba6dd599147d823db94ee82afd3e8185c","target":"record","created_at":"2026-05-17T23:52:49Z","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":"1d9f491807f81ba7e3bcf64a8ac08610157b97b29e8b7c56fa9e61ec343fea8e","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-24T11:42:13Z","title_canon_sha256":"c3b2758615ad0f6061c5b978662da6e50d64472c5779bc11e6f4892024b5b283"},"schema_version":"1.0","source":{"id":"1902.08930","kind":"arxiv","version":1}},"canonical_sha256":"cf2315d48575f770d474157917ba2063760934a7f09aab7a3bd7e6b392aee300","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf2315d48575f770d474157917ba2063760934a7f09aab7a3bd7e6b392aee300","first_computed_at":"2026-05-17T23:52:49.387259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:49.387259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JnKa+cBNvbugHkVlFSKmEd1JOo8vkStOyHYuiHdj78fMCZS94a13ATNFg4u47cpwgzpCHqkBJjy1DbTjjJ8RBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:49.387944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:354401256ccff0cf9321a79fe0d46bdba6dd599147d823db94ee82afd3e8185c","sha256:cfaa6d0983da52e5aff233777022091df1206c3131c2487507e7b71d564c7c23"],"state_sha256":"80947320af2fab763f6b2b99d8c1175536c767881a9786c97fd6e32c16e326db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+X4Ysw1RUNkh+bIFVgYOsWr/oqzd8LfgqPYrJDa2OCfImRa6pqQRxTg27iqUzjWFkVvyCi0M+C6P/YwvczVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:38:15.942112Z","bundle_sha256":"0762c68c52b43e69e17f3d379e987f3421f25edbee9c4961259e7a56f87600ba"}}