{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2QT7LIO4C2USQGNPAAVREZUG25","short_pith_number":"pith:2QT7LIO4","schema_version":"1.0","canonical_sha256":"d427f5a1dc16a92819af002b126686d75e1b7a36c2da2d5513b437d2302461d2","source":{"kind":"arxiv","id":"1907.03182","version":1},"attestation_state":"computed","paper":{"title":"Towards Testing Monotonicity of Distributions Over General Posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Anak Yodpinyanee, John Peebles, Maryam Aliakbarpour, Ronitt Rubinfeld, Themis Gouleakis","submitted_at":"2019-07-06T20:45:01Z","abstract_excerpt":"In this work, we consider the sample complexity required for testing the monotonicity of distributions over partial orders. A distribution $p$ over a poset is monotone if, for any pair of domain elements $x$ and $y$ such that $x \\preceq y$, $p(x) \\leq p(y)$. To understand the sample complexity of this problem, we introduce a new property called bigness over a finite domain, where the distribution is $T$-big if the minimum probability for any domain element is at least $T$. We establish a lower bound of $\\Omega(n/\\log n)$ for testing bigness of distributions on domains of size $n$. We then buil"},"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":"1907.03182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-06T20:45:01Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"a277c0bd913d8dcd4d2fbf52da3404451470a3a837a5cf6b2d4cac3ae6b72540","abstract_canon_sha256":"19739ebf8697d5b48afe0a29bfa5c65032c28698f2f7e1ba4a43b6c6b54f2c81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:18.714989Z","signature_b64":"9xNl3Y7NKqkX4HSFa43iG29XwHm2bt5FCdd1fr+I3Dydyu4mK+a3NVjUFvWkfYP7zfKD7/o2M6TDZ0TebtqAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d427f5a1dc16a92819af002b126686d75e1b7a36c2da2d5513b437d2302461d2","last_reissued_at":"2026-05-17T23:41:18.714391Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:18.714391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Testing Monotonicity of Distributions Over General Posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Anak Yodpinyanee, John Peebles, Maryam Aliakbarpour, Ronitt Rubinfeld, Themis Gouleakis","submitted_at":"2019-07-06T20:45:01Z","abstract_excerpt":"In this work, we consider the sample complexity required for testing the monotonicity of distributions over partial orders. A distribution $p$ over a poset is monotone if, for any pair of domain elements $x$ and $y$ such that $x \\preceq y$, $p(x) \\leq p(y)$. To understand the sample complexity of this problem, we introduce a new property called bigness over a finite domain, where the distribution is $T$-big if the minimum probability for any domain element is at least $T$. We establish a lower bound of $\\Omega(n/\\log n)$ for testing bigness of distributions on domains of size $n$. We then buil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03182","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":"1907.03182","created_at":"2026-05-17T23:41:18.714479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03182v1","created_at":"2026-05-17T23:41:18.714479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03182","created_at":"2026-05-17T23:41:18.714479+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QT7LIO4C2US","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QT7LIO4C2USQGNP","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QT7LIO4","created_at":"2026-05-18T12:33:07.085635+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/2QT7LIO4C2USQGNPAAVREZUG25","json":"https://pith.science/pith/2QT7LIO4C2USQGNPAAVREZUG25.json","graph_json":"https://pith.science/api/pith-number/2QT7LIO4C2USQGNPAAVREZUG25/graph.json","events_json":"https://pith.science/api/pith-number/2QT7LIO4C2USQGNPAAVREZUG25/events.json","paper":"https://pith.science/paper/2QT7LIO4"},"agent_actions":{"view_html":"https://pith.science/pith/2QT7LIO4C2USQGNPAAVREZUG25","download_json":"https://pith.science/pith/2QT7LIO4C2USQGNPAAVREZUG25.json","view_paper":"https://pith.science/paper/2QT7LIO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03182&json=true","fetch_graph":"https://pith.science/api/pith-number/2QT7LIO4C2USQGNPAAVREZUG25/graph.json","fetch_events":"https://pith.science/api/pith-number/2QT7LIO4C2USQGNPAAVREZUG25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QT7LIO4C2USQGNPAAVREZUG25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QT7LIO4C2USQGNPAAVREZUG25/action/storage_attestation","attest_author":"https://pith.science/pith/2QT7LIO4C2USQGNPAAVREZUG25/action/author_attestation","sign_citation":"https://pith.science/pith/2QT7LIO4C2USQGNPAAVREZUG25/action/citation_signature","submit_replication":"https://pith.science/pith/2QT7LIO4C2USQGNPAAVREZUG25/action/replication_record"}},"created_at":"2026-05-17T23:41:18.714479+00:00","updated_at":"2026-05-17T23:41:18.714479+00:00"}