{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DKI3MPWDVQN6CMFUL42H6VN7DF","short_pith_number":"pith:DKI3MPWD","schema_version":"1.0","canonical_sha256":"1a91b63ec3ac1be130b45f347f55bf196c88c5c28702d2f4189b9b8b9fe20cc5","source":{"kind":"arxiv","id":"1511.01540","version":3},"attestation_state":"computed","paper":{"title":"Efficient community detection of network flows for varying Markov times and bipartite networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Andrea Lancichinetti, Martin Rosvall, Masoumeh Kheirkhahzadeh","submitted_at":"2015-11-04T22:31:47Z","abstract_excerpt":"Community detection of network flows conventionally assumes one-step dynamics on the links. For sparse networks and interest in large-scale structures, longer timescales may be more appropriate. Oppositely, for large networks and interest in small-scale structures, shorter timescales may be better. However, current methods for analyzing networks at different timescales require expensive and often infeasible network reconstructions. To overcome this problem, we introduce a method that takes advantage of the inner-workings of the map equation and evades the reconstruction step. This makes it pos"},"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":"1511.01540","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-11-04T22:31:47Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"b06436d2ab43da1e574f375e1b8625cf804f56a4f9d83ea404754b1566c789bb","abstract_canon_sha256":"fe7b068a908eb26b24d866631951aef287f20042489cc0b4fc08c9c1362d5b5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:52.399526Z","signature_b64":"fq2bYybkg2wVAcYss/Jl/zDnKuucVwvqtBH+SQuMC1Kw3qjhTyNhEtvHyB3H9PdwC6LLWR28zmV4kxPAngi2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a91b63ec3ac1be130b45f347f55bf196c88c5c28702d2f4189b9b8b9fe20cc5","last_reissued_at":"2026-05-18T01:18:52.399037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:52.399037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient community detection of network flows for varying Markov times and bipartite networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Andrea Lancichinetti, Martin Rosvall, Masoumeh Kheirkhahzadeh","submitted_at":"2015-11-04T22:31:47Z","abstract_excerpt":"Community detection of network flows conventionally assumes one-step dynamics on the links. For sparse networks and interest in large-scale structures, longer timescales may be more appropriate. Oppositely, for large networks and interest in small-scale structures, shorter timescales may be better. However, current methods for analyzing networks at different timescales require expensive and often infeasible network reconstructions. To overcome this problem, we introduce a method that takes advantage of the inner-workings of the map equation and evades the reconstruction step. This makes it pos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01540","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":"1511.01540","created_at":"2026-05-18T01:18:52.399097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01540v3","created_at":"2026-05-18T01:18:52.399097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01540","created_at":"2026-05-18T01:18:52.399097+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKI3MPWDVQN6","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKI3MPWDVQN6CMFU","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKI3MPWD","created_at":"2026-05-18T12:29:17.054201+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/DKI3MPWDVQN6CMFUL42H6VN7DF","json":"https://pith.science/pith/DKI3MPWDVQN6CMFUL42H6VN7DF.json","graph_json":"https://pith.science/api/pith-number/DKI3MPWDVQN6CMFUL42H6VN7DF/graph.json","events_json":"https://pith.science/api/pith-number/DKI3MPWDVQN6CMFUL42H6VN7DF/events.json","paper":"https://pith.science/paper/DKI3MPWD"},"agent_actions":{"view_html":"https://pith.science/pith/DKI3MPWDVQN6CMFUL42H6VN7DF","download_json":"https://pith.science/pith/DKI3MPWDVQN6CMFUL42H6VN7DF.json","view_paper":"https://pith.science/paper/DKI3MPWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01540&json=true","fetch_graph":"https://pith.science/api/pith-number/DKI3MPWDVQN6CMFUL42H6VN7DF/graph.json","fetch_events":"https://pith.science/api/pith-number/DKI3MPWDVQN6CMFUL42H6VN7DF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKI3MPWDVQN6CMFUL42H6VN7DF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKI3MPWDVQN6CMFUL42H6VN7DF/action/storage_attestation","attest_author":"https://pith.science/pith/DKI3MPWDVQN6CMFUL42H6VN7DF/action/author_attestation","sign_citation":"https://pith.science/pith/DKI3MPWDVQN6CMFUL42H6VN7DF/action/citation_signature","submit_replication":"https://pith.science/pith/DKI3MPWDVQN6CMFUL42H6VN7DF/action/replication_record"}},"created_at":"2026-05-18T01:18:52.399097+00:00","updated_at":"2026-05-18T01:18:52.399097+00:00"}