{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DOBVDYBIDRV6T2GS2PC7FKWW2Q","short_pith_number":"pith:DOBVDYBI","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"},"canonical_sha256":"1b8351e0281c6be9e8d2d3c5f2aad6d43c48b01528d8d7b6b057b05a227f5994","source":{"kind":"arxiv","id":"1610.06525","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06525","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06525v2","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06525","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"DOBVDYBIDRV6","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DOBVDYBIDRV6T2GS","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DOBVDYBI","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DOBVDYBIDRV6T2GS2PC7FKWW2Q","target":"record","payload":{"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"},"canonical_sha256":"1b8351e0281c6be9e8d2d3c5f2aad6d43c48b01528d8d7b6b057b05a227f5994","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"},"source_kind":"arxiv","source_id":"1610.06525","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPwqy3i+576GL4KexsoYI8e333MLKpnTR9ndDwS4/DbiOUzcOw5VYAsP6NY51gP/NRW+bcmsWq2vDcaQbockDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:33:57.982156Z"},"content_sha256":"916e45a17246031db0b2eaf281a35f386718793e3081c462593237442b3dfbe3","schema_version":"1.0","event_id":"sha256:916e45a17246031db0b2eaf281a35f386718793e3081c462593237442b3dfbe3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DOBVDYBIDRV6T2GS2PC7FKWW2Q","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PRap0gNGHW7FUug1frKnplMwrTGSKOHl5EipTSxqrymvorTyixXvhVrJe9s7XctStW7/WoO+z1Uvf6Uq7fq1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:33:57.982796Z"},"content_sha256":"8054d5c27a82b4b9082813c1c3dd379c07b76f465b0b4945430e64da1d1f988f","schema_version":"1.0","event_id":"sha256:8054d5c27a82b4b9082813c1c3dd379c07b76f465b0b4945430e64da1d1f988f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q/bundle.json","state_url":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T08:33:57Z","links":{"resolver":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q","bundle":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q/bundle.json","state":"https://pith.science/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOBVDYBIDRV6T2GS2PC7FKWW2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DOBVDYBIDRV6T2GS2PC7FKWW2Q","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"072d1030a820111e6adc9e7ba78b34d6086f12cbf2ea89ad821f089035f99a3f","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2016-10-20T18:19:07Z","title_canon_sha256":"6f3029d3b4122f054c6ed19f8817d21dbb5eb4f24bf34ca12aec4803fcba38c2"},"schema_version":"1.0","source":{"id":"1610.06525","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06525","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06525v2","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06525","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"DOBVDYBIDRV6","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DOBVDYBIDRV6T2GS","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DOBVDYBI","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:8054d5c27a82b4b9082813c1c3dd379c07b76f465b0b4945430e64da1d1f988f","target":"graph","created_at":"2026-05-18T00:42:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Lucas Maystre, Matthias Grossglauser","cross_cats":["cs.LG","cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2016-10-20T18:19:07Z","title":"ChoiceRank: Identifying Preferences from Node Traffic in Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06525","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:916e45a17246031db0b2eaf281a35f386718793e3081c462593237442b3dfbe3","target":"record","created_at":"2026-05-18T00:42:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"072d1030a820111e6adc9e7ba78b34d6086f12cbf2ea89ad821f089035f99a3f","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2016-10-20T18:19:07Z","title_canon_sha256":"6f3029d3b4122f054c6ed19f8817d21dbb5eb4f24bf34ca12aec4803fcba38c2"},"schema_version":"1.0","source":{"id":"1610.06525","kind":"arxiv","version":2}},"canonical_sha256":"1b8351e0281c6be9e8d2d3c5f2aad6d43c48b01528d8d7b6b057b05a227f5994","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b8351e0281c6be9e8d2d3c5f2aad6d43c48b01528d8d7b6b057b05a227f5994","first_computed_at":"2026-05-18T00:42:18.901076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:18.901076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Iu8V/3AC+SOBfxNQEt7irE0hmKPU0n/99cLwKxF8eeJ/MQz0DotxbnemllORYKXpMCEWJxb1tRORXN1wXLFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:18.901793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06525","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:916e45a17246031db0b2eaf281a35f386718793e3081c462593237442b3dfbe3","sha256:8054d5c27a82b4b9082813c1c3dd379c07b76f465b0b4945430e64da1d1f988f"],"state_sha256":"bb1da46921f3092b5f58eb388eb14675571bda17c8ee33b07a55729b075282b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iouYny3RgES5Jub2QhJfrnuJPSnTbxKD3pvXS1QtP85AVZahcg8BTldgmzt1v6z21SzVe9kS40KctWy/+4mLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:33:57.986307Z","bundle_sha256":"497f286f8b3c9738decde0f8d66cb0cff2b32634c898c55be559a91f0b774236"}}