{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:E2KMQ6NIYGEKWYESAI3TIINCHX","short_pith_number":"pith:E2KMQ6NI","schema_version":"1.0","canonical_sha256":"2694c879a8c188ab609202373421a23dfaf4ad06fb2532836fc70ec1f8f9356e","source":{"kind":"arxiv","id":"1403.7625","version":5},"attestation_state":"computed","paper":{"title":"Testing Top Monotonicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Haris Aziz","submitted_at":"2014-03-29T11:51:07Z","abstract_excerpt":"Top monotonicity is a relaxation of various well-known domain restrictions such as single-peaked and single-crossing for which negative impossibility results are circumvented and for which the median-voter theorem still holds. We examine the problem of testing top monotonicity and present a characterization of top monotonicity with respect to non-betweenness constraints. We then extend the definition of top monotonicity to partial orders and show that testing top monotonicity of partial orders is NP-complete."},"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":"1403.7625","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-29T11:51:07Z","cross_cats_sorted":[],"title_canon_sha256":"42f22a118378d90cd057896555efd65111196121e75222ed4f6a18e0a83879e3","abstract_canon_sha256":"8a0a43d1733ee980b321a785d1c50694a0e6fbd584f5989d0b23547183a6aa42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:42.323992Z","signature_b64":"rbgn2WwvWkV+3aOct7KprKKiI5tC312dskky8troIbzO84NHPBD0MF011zV8F87FAOFbo9E8kei5aYxr/hcGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2694c879a8c188ab609202373421a23dfaf4ad06fb2532836fc70ec1f8f9356e","last_reissued_at":"2026-05-18T02:50:42.323458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:42.323458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing Top Monotonicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Haris Aziz","submitted_at":"2014-03-29T11:51:07Z","abstract_excerpt":"Top monotonicity is a relaxation of various well-known domain restrictions such as single-peaked and single-crossing for which negative impossibility results are circumvented and for which the median-voter theorem still holds. We examine the problem of testing top monotonicity and present a characterization of top monotonicity with respect to non-betweenness constraints. We then extend the definition of top monotonicity to partial orders and show that testing top monotonicity of partial orders is NP-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7625","kind":"arxiv","version":5},"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":"1403.7625","created_at":"2026-05-18T02:50:42.323552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.7625v5","created_at":"2026-05-18T02:50:42.323552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7625","created_at":"2026-05-18T02:50:42.323552+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2KMQ6NIYGEK","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2KMQ6NIYGEKWYES","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2KMQ6NI","created_at":"2026-05-18T12:28:25.294606+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/E2KMQ6NIYGEKWYESAI3TIINCHX","json":"https://pith.science/pith/E2KMQ6NIYGEKWYESAI3TIINCHX.json","graph_json":"https://pith.science/api/pith-number/E2KMQ6NIYGEKWYESAI3TIINCHX/graph.json","events_json":"https://pith.science/api/pith-number/E2KMQ6NIYGEKWYESAI3TIINCHX/events.json","paper":"https://pith.science/paper/E2KMQ6NI"},"agent_actions":{"view_html":"https://pith.science/pith/E2KMQ6NIYGEKWYESAI3TIINCHX","download_json":"https://pith.science/pith/E2KMQ6NIYGEKWYESAI3TIINCHX.json","view_paper":"https://pith.science/paper/E2KMQ6NI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.7625&json=true","fetch_graph":"https://pith.science/api/pith-number/E2KMQ6NIYGEKWYESAI3TIINCHX/graph.json","fetch_events":"https://pith.science/api/pith-number/E2KMQ6NIYGEKWYESAI3TIINCHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2KMQ6NIYGEKWYESAI3TIINCHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2KMQ6NIYGEKWYESAI3TIINCHX/action/storage_attestation","attest_author":"https://pith.science/pith/E2KMQ6NIYGEKWYESAI3TIINCHX/action/author_attestation","sign_citation":"https://pith.science/pith/E2KMQ6NIYGEKWYESAI3TIINCHX/action/citation_signature","submit_replication":"https://pith.science/pith/E2KMQ6NIYGEKWYESAI3TIINCHX/action/replication_record"}},"created_at":"2026-05-18T02:50:42.323552+00:00","updated_at":"2026-05-18T02:50:42.323552+00:00"}