{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:K6SNCR4CGFIGBB2YQDYC3BI3YO","short_pith_number":"pith:K6SNCR4C","schema_version":"1.0","canonical_sha256":"57a4d14782315060875880f02d851bc394f4a999dd031c24789ff196f02bd2dd","source":{"kind":"arxiv","id":"1403.1994","version":1},"attestation_state":"computed","paper":{"title":"Multiresolution Analysis of Incomplete Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Eric Sibony (LTCI), J\\'er\\'emie Jakubowicz (SAMOVAR), St\\'ephan Cl\\'emen\\c{c}on (LTCI)","submitted_at":"2014-03-08T18:16:38Z","abstract_excerpt":"Incomplete rankings on a set of items $\\{1,\\; \\ldots,\\; n\\}$ are orderings of the form $a_{1}\\prec\\dots\\prec a_{k}$, with $\\{a_{1},\\dots a_{k}\\}\\subset\\{1,\\dots,n\\}$ and $k < n$. Though they arise in many modern applications, only a few methods have been introduced to manipulate them, most of them consisting in representing any incomplete ranking by the set of all its possible linear extensions on $\\{1,\\; \\ldots,\\; n\\}$. It is the major purpose of this paper to introduce a completely novel approach, which allows to treat incomplete rankings directly, representing them as injective words over $"},"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.1994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-03-08T18:16:38Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"decbb5a5b4c5ef53a53c3c646fc27ecb857be5f7bccf3a28b1af7fbb3a4a7dac","abstract_canon_sha256":"2895b825f0fd61f8d6965b11ae43d202b11e09827172407a380ba09182bf9d86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:51.114716Z","signature_b64":"WO4Bc4HKdTBaTWLMpH6ay9EtMIZCSxRPF7vbwPzhWLrDxo7Z3e2T3si4JFxIvEFLMBTMBpB/G/tkEGh0IV67Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57a4d14782315060875880f02d851bc394f4a999dd031c24789ff196f02bd2dd","last_reissued_at":"2026-05-18T02:56:51.114265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:51.114265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiresolution Analysis of Incomplete Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Eric Sibony (LTCI), J\\'er\\'emie Jakubowicz (SAMOVAR), St\\'ephan Cl\\'emen\\c{c}on (LTCI)","submitted_at":"2014-03-08T18:16:38Z","abstract_excerpt":"Incomplete rankings on a set of items $\\{1,\\; \\ldots,\\; n\\}$ are orderings of the form $a_{1}\\prec\\dots\\prec a_{k}$, with $\\{a_{1},\\dots a_{k}\\}\\subset\\{1,\\dots,n\\}$ and $k < n$. Though they arise in many modern applications, only a few methods have been introduced to manipulate them, most of them consisting in representing any incomplete ranking by the set of all its possible linear extensions on $\\{1,\\; \\ldots,\\; n\\}$. It is the major purpose of this paper to introduce a completely novel approach, which allows to treat incomplete rankings directly, representing them as injective words over $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1994","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":"1403.1994","created_at":"2026-05-18T02:56:51.114340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1994v1","created_at":"2026-05-18T02:56:51.114340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1994","created_at":"2026-05-18T02:56:51.114340+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6SNCR4CGFIG","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6SNCR4CGFIGBB2Y","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6SNCR4C","created_at":"2026-05-18T12:28:35.611951+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/K6SNCR4CGFIGBB2YQDYC3BI3YO","json":"https://pith.science/pith/K6SNCR4CGFIGBB2YQDYC3BI3YO.json","graph_json":"https://pith.science/api/pith-number/K6SNCR4CGFIGBB2YQDYC3BI3YO/graph.json","events_json":"https://pith.science/api/pith-number/K6SNCR4CGFIGBB2YQDYC3BI3YO/events.json","paper":"https://pith.science/paper/K6SNCR4C"},"agent_actions":{"view_html":"https://pith.science/pith/K6SNCR4CGFIGBB2YQDYC3BI3YO","download_json":"https://pith.science/pith/K6SNCR4CGFIGBB2YQDYC3BI3YO.json","view_paper":"https://pith.science/paper/K6SNCR4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1994&json=true","fetch_graph":"https://pith.science/api/pith-number/K6SNCR4CGFIGBB2YQDYC3BI3YO/graph.json","fetch_events":"https://pith.science/api/pith-number/K6SNCR4CGFIGBB2YQDYC3BI3YO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6SNCR4CGFIGBB2YQDYC3BI3YO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6SNCR4CGFIGBB2YQDYC3BI3YO/action/storage_attestation","attest_author":"https://pith.science/pith/K6SNCR4CGFIGBB2YQDYC3BI3YO/action/author_attestation","sign_citation":"https://pith.science/pith/K6SNCR4CGFIGBB2YQDYC3BI3YO/action/citation_signature","submit_replication":"https://pith.science/pith/K6SNCR4CGFIGBB2YQDYC3BI3YO/action/replication_record"}},"created_at":"2026-05-18T02:56:51.114340+00:00","updated_at":"2026-05-18T02:56:51.114340+00:00"}