{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WE55WB37KVZLGWLOTFAIIPPDH2","short_pith_number":"pith:WE55WB37","schema_version":"1.0","canonical_sha256":"b13bdb077f5572b3596e9940843de33eadd121f0398f79acb583f08822337aba","source":{"kind":"arxiv","id":"1110.3864","version":3},"attestation_state":"computed","paper":{"title":"Robust classification of salient links in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Christian Thiemann, Daniel Grady, Dirk Brockmann","submitted_at":"2011-10-18T02:14:17Z","abstract_excerpt":"Complex networks in natural, social, and technological systems generically exhibit an abundance of rich information. Extracting meaningful structural features from data is one of the most challenging tasks in network theory. Many methods and concepts have been proposed to address this problem such as centrality statistics, motifs, community clusters, and backbones, but such schemes typically rely on external and arbitrary parameters. It is unknown whether generic networks permit the classification of elements without external intervention. Here we show that link salience is a robust approach t"},"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":"1110.3864","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-10-18T02:14:17Z","cross_cats_sorted":[],"title_canon_sha256":"426baa3060bb0569a84fb439e47867e358f60881901bcf4e3854dd366e55dc35","abstract_canon_sha256":"94d5d8b32e15e15bf71e9dac7474a136793a9fc84c3033a649a7f7b24a89a33b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:27.708025Z","signature_b64":"VtQJxPEQd4vYc9jGcCxLBKOPuubLSId4VfmZB4f71j5taHoRyd+3TeB0lBUX3wzOnrkZFMEuHeJsLh6Ul0hPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b13bdb077f5572b3596e9940843de33eadd121f0398f79acb583f08822337aba","last_reissued_at":"2026-05-18T03:54:27.707415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:27.707415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust classification of salient links in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Christian Thiemann, Daniel Grady, Dirk Brockmann","submitted_at":"2011-10-18T02:14:17Z","abstract_excerpt":"Complex networks in natural, social, and technological systems generically exhibit an abundance of rich information. Extracting meaningful structural features from data is one of the most challenging tasks in network theory. Many methods and concepts have been proposed to address this problem such as centrality statistics, motifs, community clusters, and backbones, but such schemes typically rely on external and arbitrary parameters. It is unknown whether generic networks permit the classification of elements without external intervention. Here we show that link salience is a robust approach t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3864","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":"1110.3864","created_at":"2026-05-18T03:54:27.707512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3864v3","created_at":"2026-05-18T03:54:27.707512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3864","created_at":"2026-05-18T03:54:27.707512+00:00"},{"alias_kind":"pith_short_12","alias_value":"WE55WB37KVZL","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WE55WB37KVZLGWLO","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WE55WB37","created_at":"2026-05-18T12:26:44.992195+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/WE55WB37KVZLGWLOTFAIIPPDH2","json":"https://pith.science/pith/WE55WB37KVZLGWLOTFAIIPPDH2.json","graph_json":"https://pith.science/api/pith-number/WE55WB37KVZLGWLOTFAIIPPDH2/graph.json","events_json":"https://pith.science/api/pith-number/WE55WB37KVZLGWLOTFAIIPPDH2/events.json","paper":"https://pith.science/paper/WE55WB37"},"agent_actions":{"view_html":"https://pith.science/pith/WE55WB37KVZLGWLOTFAIIPPDH2","download_json":"https://pith.science/pith/WE55WB37KVZLGWLOTFAIIPPDH2.json","view_paper":"https://pith.science/paper/WE55WB37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3864&json=true","fetch_graph":"https://pith.science/api/pith-number/WE55WB37KVZLGWLOTFAIIPPDH2/graph.json","fetch_events":"https://pith.science/api/pith-number/WE55WB37KVZLGWLOTFAIIPPDH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WE55WB37KVZLGWLOTFAIIPPDH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WE55WB37KVZLGWLOTFAIIPPDH2/action/storage_attestation","attest_author":"https://pith.science/pith/WE55WB37KVZLGWLOTFAIIPPDH2/action/author_attestation","sign_citation":"https://pith.science/pith/WE55WB37KVZLGWLOTFAIIPPDH2/action/citation_signature","submit_replication":"https://pith.science/pith/WE55WB37KVZLGWLOTFAIIPPDH2/action/replication_record"}},"created_at":"2026-05-18T03:54:27.707512+00:00","updated_at":"2026-05-18T03:54:27.707512+00:00"}