{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DOBVDYBIDRV6T2GS2PC7FKWW2Q","short_pith_number":"pith:DOBVDYBI","schema_version":"1.0","canonical_sha256":"1b8351e0281c6be9e8d2d3c5f2aad6d43c48b01528d8d7b6b057b05a227f5994","source":{"kind":"arxiv","id":"1610.06525","version":2},"attestation_state":"computed","paper":{"title":"ChoiceRank: Identifying Preferences from Node Traffic in Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Lucas Maystre, Matthias Grossglauser","submitted_at":"2016-10-20T18:19:07Z","abstract_excerpt":"Understanding how users navigate in a network is of high interest in many applications. We consider a setting where only aggregate node-level traffic is observed and tackle the task of learning edge transition probabilities. We cast it as a preference learning problem, and we study a model where choices follow Luce's axiom. In this case, the $O(n)$ marginal counts of node visits are a sufficient statistic for the $O(n^2)$ transition probabilities. We show how to make the inference problem well-posed regardless of the network's structure, and we present ChoiceRank, an iterative algorithm that s"},"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":"1610.06525","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2016-10-20T18:19:07Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"6f3029d3b4122f054c6ed19f8817d21dbb5eb4f24bf34ca12aec4803fcba38c2","abstract_canon_sha256":"072d1030a820111e6adc9e7ba78b34d6086f12cbf2ea89ad821f089035f99a3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:18.901793Z","signature_b64":"9Iu8V/3AC+SOBfxNQEt7irE0hmKPU0n/99cLwKxF8eeJ/MQz0DotxbnemllORYKXpMCEWJxb1tRORXN1wXLFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b8351e0281c6be9e8d2d3c5f2aad6d43c48b01528d8d7b6b057b05a227f5994","last_reissued_at":"2026-05-18T00:42:18.901076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:18.901076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ChoiceRank: Identifying Preferences from Node Traffic in Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Lucas Maystre, Matthias Grossglauser","submitted_at":"2016-10-20T18:19:07Z","abstract_excerpt":"Understanding how users navigate in a network is of high interest in many applications. We consider a setting where only aggregate node-level traffic is observed and tackle the task of learning edge transition probabilities. We cast it as a preference learning problem, and we study a model where choices follow Luce's axiom. In this case, the $O(n)$ marginal counts of node visits are a sufficient statistic for the $O(n^2)$ transition probabilities. We show how to make the inference problem well-posed regardless of the network's structure, and we present ChoiceRank, an iterative algorithm that s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06525","kind":"arxiv","version":2},"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":"1610.06525","created_at":"2026-05-18T00:42:18.901336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06525v2","created_at":"2026-05-18T00:42:18.901336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06525","created_at":"2026-05-18T00:42:18.901336+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOBVDYBIDRV6","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOBVDYBIDRV6T2GS","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOBVDYBI","created_at":"2026-05-18T12:30:12.583610+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/DOBVDYBIDRV6T2GS2PC7FKWW2Q","json":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q.json","graph_json":"https://pith.science/api/pith-number/DOBVDYBIDRV6T2GS2PC7FKWW2Q/graph.json","events_json":"https://pith.science/api/pith-number/DOBVDYBIDRV6T2GS2PC7FKWW2Q/events.json","paper":"https://pith.science/paper/DOBVDYBI"},"agent_actions":{"view_html":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q","download_json":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q.json","view_paper":"https://pith.science/paper/DOBVDYBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06525&json=true","fetch_graph":"https://pith.science/api/pith-number/DOBVDYBIDRV6T2GS2PC7FKWW2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/DOBVDYBIDRV6T2GS2PC7FKWW2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q/action/storage_attestation","attest_author":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q/action/author_attestation","sign_citation":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q/action/citation_signature","submit_replication":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q/action/replication_record"}},"created_at":"2026-05-18T00:42:18.901336+00:00","updated_at":"2026-05-18T00:42:18.901336+00:00"}