{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DVUBFJ5G5BUS2OYHB553LQ52UQ","short_pith_number":"pith:DVUBFJ5G","schema_version":"1.0","canonical_sha256":"1d6812a7a6e8692d3b070f7bb5c3baa40c10584d1a7bd2d68b0928546ad8bdac","source":{"kind":"arxiv","id":"1302.6766","version":3},"attestation_state":"computed","paper":{"title":"A bag-of-paths framework for network data analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Amin Mantrach, Fabrice Rossi, Ilkka Kivim\\\"aki, Kevin Fran\\c{c}oisse, Marco Saerens","submitted_at":"2013-02-27T13:41:44Z","abstract_excerpt":"This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of all paths in a network. More precisely, a Gibbs-Boltzmann distribution is defined over a bag of paths in a network, that is, on a representation that considers all paths independently. We show that, under this distribution, the probability of drawing a path connecting two nodes can easily be computed in closed form by simple matrix inversion. This probability captures a notion of relatedness between nodes of the graph:"},"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":"1302.6766","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-27T13:41:44Z","cross_cats_sorted":[],"title_canon_sha256":"bf18656c4bbd8bd55dfe79f95cb9285451673499c4f58d3fefd6b1e476d98e4e","abstract_canon_sha256":"a9378767b58afc1d8d0b26856be27ee7e0e48a0bbe3186694015acc446f1c5ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:18.699104Z","signature_b64":"0xIC331TbhoqmiOPr1vgXRRmwtCPqNLlcYtptI/UkIxg3I3EiBLo30EOwW1BwAHXgsKXOy0D0I14gscwWt9jBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d6812a7a6e8692d3b070f7bb5c3baa40c10584d1a7bd2d68b0928546ad8bdac","last_reissued_at":"2026-05-18T00:41:18.698313Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:18.698313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A bag-of-paths framework for network data analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Amin Mantrach, Fabrice Rossi, Ilkka Kivim\\\"aki, Kevin Fran\\c{c}oisse, Marco Saerens","submitted_at":"2013-02-27T13:41:44Z","abstract_excerpt":"This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of all paths in a network. More precisely, a Gibbs-Boltzmann distribution is defined over a bag of paths in a network, that is, on a representation that considers all paths independently. We show that, under this distribution, the probability of drawing a path connecting two nodes can easily be computed in closed form by simple matrix inversion. This probability captures a notion of relatedness between nodes of the graph:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6766","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":""},"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":"1302.6766","created_at":"2026-05-18T00:41:18.698455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6766v3","created_at":"2026-05-18T00:41:18.698455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6766","created_at":"2026-05-18T00:41:18.698455+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVUBFJ5G5BUS","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVUBFJ5G5BUS2OYH","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVUBFJ5G","created_at":"2026-05-18T12:27:43.054852+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/DVUBFJ5G5BUS2OYHB553LQ52UQ","json":"https://pith.science/pith/DVUBFJ5G5BUS2OYHB553LQ52UQ.json","graph_json":"https://pith.science/api/pith-number/DVUBFJ5G5BUS2OYHB553LQ52UQ/graph.json","events_json":"https://pith.science/api/pith-number/DVUBFJ5G5BUS2OYHB553LQ52UQ/events.json","paper":"https://pith.science/paper/DVUBFJ5G"},"agent_actions":{"view_html":"https://pith.science/pith/DVUBFJ5G5BUS2OYHB553LQ52UQ","download_json":"https://pith.science/pith/DVUBFJ5G5BUS2OYHB553LQ52UQ.json","view_paper":"https://pith.science/paper/DVUBFJ5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6766&json=true","fetch_graph":"https://pith.science/api/pith-number/DVUBFJ5G5BUS2OYHB553LQ52UQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DVUBFJ5G5BUS2OYHB553LQ52UQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVUBFJ5G5BUS2OYHB553LQ52UQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVUBFJ5G5BUS2OYHB553LQ52UQ/action/storage_attestation","attest_author":"https://pith.science/pith/DVUBFJ5G5BUS2OYHB553LQ52UQ/action/author_attestation","sign_citation":"https://pith.science/pith/DVUBFJ5G5BUS2OYHB553LQ52UQ/action/citation_signature","submit_replication":"https://pith.science/pith/DVUBFJ5G5BUS2OYHB553LQ52UQ/action/replication_record"}},"created_at":"2026-05-18T00:41:18.698455+00:00","updated_at":"2026-05-18T00:41:18.698455+00:00"}