{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HPVB5RCPQYTF7BNQBAZG6VPVAY","short_pith_number":"pith:HPVB5RCP","schema_version":"1.0","canonical_sha256":"3bea1ec44f86265f85b008326f55f50630434af0780d9dc4435eb7ab547641fc","source":{"kind":"arxiv","id":"2201.07577","version":4},"attestation_state":"computed","paper":{"title":"Models for information propagation on graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","cs.SI","math.AP"],"primary_cat":"math.NA","authors_text":"Charles M. Elliott, Lisa Maria Kreusser, Oliver R. A. Dunbar","submitted_at":"2022-01-19T12:59:04Z","abstract_excerpt":"We propose and unify classes of different models for information propagation over graphs. In a first class, propagation is modelled as a wave which emanates from a set of \\emph{known} nodes at an initial time, to all other \\emph{unknown} nodes at later times with an ordering determined by the arrival time of the information wave front. A second class of models is based on the notion of a travel time along paths between nodes. The time of information propagation from an initial \\emph{known} set of nodes to a node is defined as the minimum of a generalised travel time over subsets of all admissi"},"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":"2201.07577","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.NA","submitted_at":"2022-01-19T12:59:04Z","cross_cats_sorted":["cs.LG","cs.NA","cs.SI","math.AP"],"title_canon_sha256":"4d18ddccada4a4ef283ea3838218d16577a8eb4e4abdf2baeb3f2c79954c3e34","abstract_canon_sha256":"a116afac83f947b284adb79b6137fb672c5e1ba7a0f035939fe1d80eda57ea56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:34.670756Z","signature_b64":"+eVOxwKZ24ygh/17uURwa0s2ep7cK21F1uuW7GCxSyOmmlCopCG0EFHOp31VD6E6VaLiJMhfsApfTPEhr+iEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bea1ec44f86265f85b008326f55f50630434af0780d9dc4435eb7ab547641fc","last_reissued_at":"2026-07-05T12:07:34.670276Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:34.670276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Models for information propagation on graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","cs.SI","math.AP"],"primary_cat":"math.NA","authors_text":"Charles M. Elliott, Lisa Maria Kreusser, Oliver R. A. Dunbar","submitted_at":"2022-01-19T12:59:04Z","abstract_excerpt":"We propose and unify classes of different models for information propagation over graphs. In a first class, propagation is modelled as a wave which emanates from a set of \\emph{known} nodes at an initial time, to all other \\emph{unknown} nodes at later times with an ordering determined by the arrival time of the information wave front. A second class of models is based on the notion of a travel time along paths between nodes. The time of information propagation from an initial \\emph{known} set of nodes to a node is defined as the minimum of a generalised travel time over subsets of all admissi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.07577","kind":"arxiv","version":4},"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/2201.07577/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":"2201.07577","created_at":"2026-07-05T12:07:34.670337+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.07577v4","created_at":"2026-07-05T12:07:34.670337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.07577","created_at":"2026-07-05T12:07:34.670337+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPVB5RCPQYTF","created_at":"2026-07-05T12:07:34.670337+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPVB5RCPQYTF7BNQ","created_at":"2026-07-05T12:07:34.670337+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPVB5RCP","created_at":"2026-07-05T12:07:34.670337+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00389","citing_title":"Momentum-based minimization of the Ginzburg-Landau functional on Euclidean spaces and graphs","ref_index":2007,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HPVB5RCPQYTF7BNQBAZG6VPVAY","json":"https://pith.science/pith/HPVB5RCPQYTF7BNQBAZG6VPVAY.json","graph_json":"https://pith.science/api/pith-number/HPVB5RCPQYTF7BNQBAZG6VPVAY/graph.json","events_json":"https://pith.science/api/pith-number/HPVB5RCPQYTF7BNQBAZG6VPVAY/events.json","paper":"https://pith.science/paper/HPVB5RCP"},"agent_actions":{"view_html":"https://pith.science/pith/HPVB5RCPQYTF7BNQBAZG6VPVAY","download_json":"https://pith.science/pith/HPVB5RCPQYTF7BNQBAZG6VPVAY.json","view_paper":"https://pith.science/paper/HPVB5RCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.07577&json=true","fetch_graph":"https://pith.science/api/pith-number/HPVB5RCPQYTF7BNQBAZG6VPVAY/graph.json","fetch_events":"https://pith.science/api/pith-number/HPVB5RCPQYTF7BNQBAZG6VPVAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPVB5RCPQYTF7BNQBAZG6VPVAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPVB5RCPQYTF7BNQBAZG6VPVAY/action/storage_attestation","attest_author":"https://pith.science/pith/HPVB5RCPQYTF7BNQBAZG6VPVAY/action/author_attestation","sign_citation":"https://pith.science/pith/HPVB5RCPQYTF7BNQBAZG6VPVAY/action/citation_signature","submit_replication":"https://pith.science/pith/HPVB5RCPQYTF7BNQBAZG6VPVAY/action/replication_record"}},"created_at":"2026-07-05T12:07:34.670337+00:00","updated_at":"2026-07-05T12:07:34.670337+00:00"}