{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AUNWTFA32A7XINZH7TA4FNFUTJ","short_pith_number":"pith:AUNWTFA3","schema_version":"1.0","canonical_sha256":"051b69941bd03f743727fcc1c2b4b49a53a1be5485013c5ebd95368032988932","source":{"kind":"arxiv","id":"2305.02536","version":3},"attestation_state":"computed","paper":{"title":"Scanpath Prediction in Panoramic Videos via Expected Code Length Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kanglong Fan, Kede Ma, Mu Li","submitted_at":"2023-05-04T04:10:47Z","abstract_excerpt":"Predicting human scanpaths when exploring panoramic videos is a challenging task due to the spherical geometry and the multimodality of the input, and the inherent uncertainty and diversity of the output. Most previous methods fail to give a complete treatment of these characteristics, and thus are prone to errors. In this paper, we present a simple new criterion for scanpath prediction based on principles from lossy data compression. This criterion suggests minimizing the expected code length of quantized scanpaths in a training set, which corresponds to fitting a discrete conditional probabi"},"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":"2305.02536","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-05-04T04:10:47Z","cross_cats_sorted":[],"title_canon_sha256":"4ae96156b966a7641e4f79f72b72850560b83d8f763e715410500de87ea786f5","abstract_canon_sha256":"e8ccc2cf7891ca7faee2e6ed7fc1996935748898f51fb432362d2ca8f4230088"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:27.600847Z","signature_b64":"P5FFwpsABZh9pgBjP+Ao/NBjsXS2dkKA38mSg6hjsge7VH80wESYrhyDIy1KFlWtRJ9DTR4Ri8PrkhaW0+KjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"051b69941bd03f743727fcc1c2b4b49a53a1be5485013c5ebd95368032988932","last_reissued_at":"2026-07-05T11:54:27.600332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:27.600332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scanpath Prediction in Panoramic Videos via Expected Code Length Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kanglong Fan, Kede Ma, Mu Li","submitted_at":"2023-05-04T04:10:47Z","abstract_excerpt":"Predicting human scanpaths when exploring panoramic videos is a challenging task due to the spherical geometry and the multimodality of the input, and the inherent uncertainty and diversity of the output. Most previous methods fail to give a complete treatment of these characteristics, and thus are prone to errors. In this paper, we present a simple new criterion for scanpath prediction based on principles from lossy data compression. This criterion suggests minimizing the expected code length of quantized scanpaths in a training set, which corresponds to fitting a discrete conditional probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.02536","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.02536/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":"2305.02536","created_at":"2026-07-05T11:54:27.600396+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.02536v3","created_at":"2026-07-05T11:54:27.600396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.02536","created_at":"2026-07-05T11:54:27.600396+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUNWTFA32A7X","created_at":"2026-07-05T11:54:27.600396+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUNWTFA32A7XINZH","created_at":"2026-07-05T11:54:27.600396+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUNWTFA3","created_at":"2026-07-05T11:54:27.600396+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/AUNWTFA32A7XINZH7TA4FNFUTJ","json":"https://pith.science/pith/AUNWTFA32A7XINZH7TA4FNFUTJ.json","graph_json":"https://pith.science/api/pith-number/AUNWTFA32A7XINZH7TA4FNFUTJ/graph.json","events_json":"https://pith.science/api/pith-number/AUNWTFA32A7XINZH7TA4FNFUTJ/events.json","paper":"https://pith.science/paper/AUNWTFA3"},"agent_actions":{"view_html":"https://pith.science/pith/AUNWTFA32A7XINZH7TA4FNFUTJ","download_json":"https://pith.science/pith/AUNWTFA32A7XINZH7TA4FNFUTJ.json","view_paper":"https://pith.science/paper/AUNWTFA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.02536&json=true","fetch_graph":"https://pith.science/api/pith-number/AUNWTFA32A7XINZH7TA4FNFUTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/AUNWTFA32A7XINZH7TA4FNFUTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUNWTFA32A7XINZH7TA4FNFUTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUNWTFA32A7XINZH7TA4FNFUTJ/action/storage_attestation","attest_author":"https://pith.science/pith/AUNWTFA32A7XINZH7TA4FNFUTJ/action/author_attestation","sign_citation":"https://pith.science/pith/AUNWTFA32A7XINZH7TA4FNFUTJ/action/citation_signature","submit_replication":"https://pith.science/pith/AUNWTFA32A7XINZH7TA4FNFUTJ/action/replication_record"}},"created_at":"2026-07-05T11:54:27.600396+00:00","updated_at":"2026-07-05T11:54:27.600396+00:00"}