{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RZXW2SXE625L4H7NSVKOJJIBPO","short_pith_number":"pith:RZXW2SXE","schema_version":"1.0","canonical_sha256":"8e6f6d4ae4f6babe1fed9554e4a5017b8c9f24d2fc2c136ade666ad50359fb36","source":{"kind":"arxiv","id":"1908.10667","version":1},"attestation_state":"computed","paper":{"title":"Centrality-based identification of important edges in complex networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Klaus Lehnertz, Timo Br\\\"ohl","submitted_at":"2019-08-25T13:47:54Z","abstract_excerpt":"Centrality is one of the most fundamental metrics in network science. Despite an abundance of methods for measuring centrality of individual vertices, there are by now only a few metrics to measure centrality of individual edges. We modify various, widely used centrality concepts for vertices to those for edges, in order to find which edges in a network are important between other pairs of vertices. Focusing on the importance of edges, we propose an edge-centrality-based network decomposition technique to identify a hierarchy of sets of edges, where each set is associated with a different leve"},"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":"1908.10667","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"physics.soc-ph","submitted_at":"2019-08-25T13:47:54Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"d67f5f70096e0a0019618237edb8888cedb14885f2538db2c089b1fbd5e8a9b4","abstract_canon_sha256":"f2d9345257b287321bc9394f58f46c35888190c8f91fd201eaccd50bf21ccd7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:06:56.033681Z","signature_b64":"VYC/kla6zwDbYWfakmx+5ee/LcJ9acddMHghUrOeo6h+bzoGN5N8Wm+Ao809UAzNY2OAE3s8KHuxB95Hp9JuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e6f6d4ae4f6babe1fed9554e4a5017b8c9f24d2fc2c136ade666ad50359fb36","last_reissued_at":"2026-07-05T00:06:56.033230Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:06:56.033230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Centrality-based identification of important edges in complex networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Klaus Lehnertz, Timo Br\\\"ohl","submitted_at":"2019-08-25T13:47:54Z","abstract_excerpt":"Centrality is one of the most fundamental metrics in network science. Despite an abundance of methods for measuring centrality of individual vertices, there are by now only a few metrics to measure centrality of individual edges. We modify various, widely used centrality concepts for vertices to those for edges, in order to find which edges in a network are important between other pairs of vertices. Focusing on the importance of edges, we propose an edge-centrality-based network decomposition technique to identify a hierarchy of sets of edges, where each set is associated with a different leve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.10667","kind":"arxiv","version":1},"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/1908.10667/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":"1908.10667","created_at":"2026-07-05T00:06:56.033290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.10667v1","created_at":"2026-07-05T00:06:56.033290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.10667","created_at":"2026-07-05T00:06:56.033290+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZXW2SXE625L","created_at":"2026-07-05T00:06:56.033290+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZXW2SXE625L4H7N","created_at":"2026-07-05T00:06:56.033290+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZXW2SXE","created_at":"2026-07-05T00:06:56.033290+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/RZXW2SXE625L4H7NSVKOJJIBPO","json":"https://pith.science/pith/RZXW2SXE625L4H7NSVKOJJIBPO.json","graph_json":"https://pith.science/api/pith-number/RZXW2SXE625L4H7NSVKOJJIBPO/graph.json","events_json":"https://pith.science/api/pith-number/RZXW2SXE625L4H7NSVKOJJIBPO/events.json","paper":"https://pith.science/paper/RZXW2SXE"},"agent_actions":{"view_html":"https://pith.science/pith/RZXW2SXE625L4H7NSVKOJJIBPO","download_json":"https://pith.science/pith/RZXW2SXE625L4H7NSVKOJJIBPO.json","view_paper":"https://pith.science/paper/RZXW2SXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.10667&json=true","fetch_graph":"https://pith.science/api/pith-number/RZXW2SXE625L4H7NSVKOJJIBPO/graph.json","fetch_events":"https://pith.science/api/pith-number/RZXW2SXE625L4H7NSVKOJJIBPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZXW2SXE625L4H7NSVKOJJIBPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZXW2SXE625L4H7NSVKOJJIBPO/action/storage_attestation","attest_author":"https://pith.science/pith/RZXW2SXE625L4H7NSVKOJJIBPO/action/author_attestation","sign_citation":"https://pith.science/pith/RZXW2SXE625L4H7NSVKOJJIBPO/action/citation_signature","submit_replication":"https://pith.science/pith/RZXW2SXE625L4H7NSVKOJJIBPO/action/replication_record"}},"created_at":"2026-07-05T00:06:56.033290+00:00","updated_at":"2026-07-05T00:06:56.033290+00:00"}