{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4KQGUQOP7RJIXRJT44QGSEZAWI","short_pith_number":"pith:4KQGUQOP","schema_version":"1.0","canonical_sha256":"e2a06a41cffc528bc533e720691320b2146dbe25eeec2b15488a10058125dfe0","source":{"kind":"arxiv","id":"2607.07153","version":1},"attestation_state":"computed","paper":{"title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Seiei Ando, Yu Yokoi","submitted_at":"2026-07-08T08:47:23Z","abstract_excerpt":"We study ranking and rank aggregation under the Kendall tau distance, subject to matroid or flag matroid constraints on prefixes of the output ranking. In the matroid case, the top-$k$ prefix is required to form a base of a matroid; in the flag matroid case, several prescribed prefixes are required to form bases of a sequence of matroids linked by quotient relations. This framework contains the previously studied notions of $k$-fairness and block-fairness as special cases, and also captures more general hierarchical and assignment-type lower- and upper-quota constraints.\n  We provide a polynom"},"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":"2607.07153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-07-08T08:47:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5ac0b1ba56f2b535ac8e9a9ca006fee50b28bd34b6ece5bba7326611293ae162","abstract_canon_sha256":"4f0696c4f3c08a3cf14bef16f6ac24d6d15addfa4329772d0b8e5456234fad90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:15.841431Z","signature_b64":"v3oB3FUNsDueomfHmSmPvumxuos5znaj+12p9sbelumFHQmA/wXZ5I+6qFpxeVwbqGs6kNJaSj7OP76W6xmZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2a06a41cffc528bc533e720691320b2146dbe25eeec2b15488a10058125dfe0","last_reissued_at":"2026-07-09T01:20:15.841084Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:15.841084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Seiei Ando, Yu Yokoi","submitted_at":"2026-07-08T08:47:23Z","abstract_excerpt":"We study ranking and rank aggregation under the Kendall tau distance, subject to matroid or flag matroid constraints on prefixes of the output ranking. In the matroid case, the top-$k$ prefix is required to form a base of a matroid; in the flag matroid case, several prescribed prefixes are required to form bases of a sequence of matroids linked by quotient relations. This framework contains the previously studied notions of $k$-fairness and block-fairness as special cases, and also captures more general hierarchical and assignment-type lower- and upper-quota constraints.\n  We provide a polynom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07153","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07153/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.07153","created_at":"2026-07-09T01:20:15.841139+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07153v1","created_at":"2026-07-09T01:20:15.841139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07153","created_at":"2026-07-09T01:20:15.841139+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KQGUQOP7RJI","created_at":"2026-07-09T01:20:15.841139+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KQGUQOP7RJIXRJT","created_at":"2026-07-09T01:20:15.841139+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KQGUQOP","created_at":"2026-07-09T01:20:15.841139+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/4KQGUQOP7RJIXRJT44QGSEZAWI","json":"https://pith.science/pith/4KQGUQOP7RJIXRJT44QGSEZAWI.json","graph_json":"https://pith.science/api/pith-number/4KQGUQOP7RJIXRJT44QGSEZAWI/graph.json","events_json":"https://pith.science/api/pith-number/4KQGUQOP7RJIXRJT44QGSEZAWI/events.json","paper":"https://pith.science/paper/4KQGUQOP"},"agent_actions":{"view_html":"https://pith.science/pith/4KQGUQOP7RJIXRJT44QGSEZAWI","download_json":"https://pith.science/pith/4KQGUQOP7RJIXRJT44QGSEZAWI.json","view_paper":"https://pith.science/paper/4KQGUQOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07153&json=true","fetch_graph":"https://pith.science/api/pith-number/4KQGUQOP7RJIXRJT44QGSEZAWI/graph.json","fetch_events":"https://pith.science/api/pith-number/4KQGUQOP7RJIXRJT44QGSEZAWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KQGUQOP7RJIXRJT44QGSEZAWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KQGUQOP7RJIXRJT44QGSEZAWI/action/storage_attestation","attest_author":"https://pith.science/pith/4KQGUQOP7RJIXRJT44QGSEZAWI/action/author_attestation","sign_citation":"https://pith.science/pith/4KQGUQOP7RJIXRJT44QGSEZAWI/action/citation_signature","submit_replication":"https://pith.science/pith/4KQGUQOP7RJIXRJT44QGSEZAWI/action/replication_record"}},"created_at":"2026-07-09T01:20:15.841139+00:00","updated_at":"2026-07-09T01:20:15.841139+00:00"}