{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:IC3S7YJP2JPFHVIAKBNTXRZWNA","short_pith_number":"pith:IC3S7YJP","schema_version":"1.0","canonical_sha256":"40b72fe12fd25e53d500505b3bc736680ec5491230817711e683d706f13478e2","source":{"kind":"arxiv","id":"0910.0895","version":3},"attestation_state":"computed","paper":{"title":"Inferring Rankings Using Constrained Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Devavrat Shah, Srikanth Jagabathula","submitted_at":"2009-10-06T16:27:46Z","abstract_excerpt":"We consider the problem of recovering a function over the space of permutations (or, the symmetric group) over $n$ elements from given partial information; the partial information we consider is related to the group theoretic Fourier Transform of the function. This problem naturally arises in several settings such as ranked elections, multi-object tracking, ranking systems, and recommendation systems. Inspired by the work of Donoho and Stark in the context of discrete-time functions, we focus on non-negative functions with a sparse support (support size $\\ll$ domain size). Our recovery method "},"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":"0910.0895","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2009-10-06T16:27:46Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"364e2493972d9d843d268436b74c283dadb73810f2ecc3a3b91467f3bcae238f","abstract_canon_sha256":"b1c4ef74e89ffa62e73cd549f1bdb17b496908de8ab1e4e58d3cb9d0b77e3457"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:43.932309Z","signature_b64":"OersSZI0kamZkFp7iZk/okdL9WYLQq8QpC2lQdl2g9vResV5hKnleK84zZwscFSOAWe9VOYPtkXuWXPwzBLiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40b72fe12fd25e53d500505b3bc736680ec5491230817711e683d706f13478e2","last_reissued_at":"2026-05-18T04:19:43.931485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:43.931485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inferring Rankings Using Constrained Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Devavrat Shah, Srikanth Jagabathula","submitted_at":"2009-10-06T16:27:46Z","abstract_excerpt":"We consider the problem of recovering a function over the space of permutations (or, the symmetric group) over $n$ elements from given partial information; the partial information we consider is related to the group theoretic Fourier Transform of the function. This problem naturally arises in several settings such as ranked elections, multi-object tracking, ranking systems, and recommendation systems. Inspired by the work of Donoho and Stark in the context of discrete-time functions, we focus on non-negative functions with a sparse support (support size $\\ll$ domain size). Our recovery method "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.0895","kind":"arxiv","version":3},"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":"0910.0895","created_at":"2026-05-18T04:19:43.931640+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.0895v3","created_at":"2026-05-18T04:19:43.931640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.0895","created_at":"2026-05-18T04:19:43.931640+00:00"},{"alias_kind":"pith_short_12","alias_value":"IC3S7YJP2JPF","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"IC3S7YJP2JPFHVIA","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"IC3S7YJP","created_at":"2026-05-18T12:26:00.592388+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/IC3S7YJP2JPFHVIAKBNTXRZWNA","json":"https://pith.science/pith/IC3S7YJP2JPFHVIAKBNTXRZWNA.json","graph_json":"https://pith.science/api/pith-number/IC3S7YJP2JPFHVIAKBNTXRZWNA/graph.json","events_json":"https://pith.science/api/pith-number/IC3S7YJP2JPFHVIAKBNTXRZWNA/events.json","paper":"https://pith.science/paper/IC3S7YJP"},"agent_actions":{"view_html":"https://pith.science/pith/IC3S7YJP2JPFHVIAKBNTXRZWNA","download_json":"https://pith.science/pith/IC3S7YJP2JPFHVIAKBNTXRZWNA.json","view_paper":"https://pith.science/paper/IC3S7YJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.0895&json=true","fetch_graph":"https://pith.science/api/pith-number/IC3S7YJP2JPFHVIAKBNTXRZWNA/graph.json","fetch_events":"https://pith.science/api/pith-number/IC3S7YJP2JPFHVIAKBNTXRZWNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IC3S7YJP2JPFHVIAKBNTXRZWNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IC3S7YJP2JPFHVIAKBNTXRZWNA/action/storage_attestation","attest_author":"https://pith.science/pith/IC3S7YJP2JPFHVIAKBNTXRZWNA/action/author_attestation","sign_citation":"https://pith.science/pith/IC3S7YJP2JPFHVIAKBNTXRZWNA/action/citation_signature","submit_replication":"https://pith.science/pith/IC3S7YJP2JPFHVIAKBNTXRZWNA/action/replication_record"}},"created_at":"2026-05-18T04:19:43.931640+00:00","updated_at":"2026-05-18T04:19:43.931640+00:00"}