{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SLTDI6YUNKOFMRXQPITSXHGMSU","short_pith_number":"pith:SLTDI6YU","schema_version":"1.0","canonical_sha256":"92e6347b146a9c5646f07a272b9ccc950c3ccaa8950b5a4116858ef695c4b9b5","source":{"kind":"arxiv","id":"1706.04110","version":1},"attestation_state":"computed","paper":{"title":"Compressing networks with super nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Marc Niethammer, Natalie Stanley, Peter J. Mucha, Roland Kwitt","submitted_at":"2017-06-13T14:59:53Z","abstract_excerpt":"Community detection is a commonly used technique for identifying groups in a network based on similarities in connectivity patterns. To facilitate community detection in large networks, we recast the network to be partitioned into a smaller network of 'super nodes', each super node comprising one or more nodes in the original network. To define the seeds of our super nodes, we apply the 'CoreHD' ranking from dismantling and decycling. We test our approach through the analysis of two common methods for community detection: modularity maximization with the Louvain algorithm and maximum likelihoo"},"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":"1706.04110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-13T14:59:53Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"b7fd8923bf6225a0a1207bfa48dca3ccad56403932ddb7fd26fe38c6d92421e6","abstract_canon_sha256":"3ac73265e648b134dac949bc369cdf72f66f9d8ca38243ed01db09e42e4084bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:24.482188Z","signature_b64":"EnRjXB9wWoqt1JxGkCzUAo6r2zbIbC2LC7AdFvcpBQ2uC9i+bJomuuz1sFaR1V/4RGF9m8QvslLmglU5lnh7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92e6347b146a9c5646f07a272b9ccc950c3ccaa8950b5a4116858ef695c4b9b5","last_reissued_at":"2026-05-18T00:42:24.481711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:24.481711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressing networks with super nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Marc Niethammer, Natalie Stanley, Peter J. Mucha, Roland Kwitt","submitted_at":"2017-06-13T14:59:53Z","abstract_excerpt":"Community detection is a commonly used technique for identifying groups in a network based on similarities in connectivity patterns. To facilitate community detection in large networks, we recast the network to be partitioned into a smaller network of 'super nodes', each super node comprising one or more nodes in the original network. To define the seeds of our super nodes, we apply the 'CoreHD' ranking from dismantling and decycling. We test our approach through the analysis of two common methods for community detection: modularity maximization with the Louvain algorithm and maximum likelihoo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04110","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":""},"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":"1706.04110","created_at":"2026-05-18T00:42:24.481791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04110v1","created_at":"2026-05-18T00:42:24.481791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04110","created_at":"2026-05-18T00:42:24.481791+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLTDI6YUNKOF","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLTDI6YUNKOFMRXQ","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLTDI6YU","created_at":"2026-05-18T12:31:43.269735+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/SLTDI6YUNKOFMRXQPITSXHGMSU","json":"https://pith.science/pith/SLTDI6YUNKOFMRXQPITSXHGMSU.json","graph_json":"https://pith.science/api/pith-number/SLTDI6YUNKOFMRXQPITSXHGMSU/graph.json","events_json":"https://pith.science/api/pith-number/SLTDI6YUNKOFMRXQPITSXHGMSU/events.json","paper":"https://pith.science/paper/SLTDI6YU"},"agent_actions":{"view_html":"https://pith.science/pith/SLTDI6YUNKOFMRXQPITSXHGMSU","download_json":"https://pith.science/pith/SLTDI6YUNKOFMRXQPITSXHGMSU.json","view_paper":"https://pith.science/paper/SLTDI6YU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04110&json=true","fetch_graph":"https://pith.science/api/pith-number/SLTDI6YUNKOFMRXQPITSXHGMSU/graph.json","fetch_events":"https://pith.science/api/pith-number/SLTDI6YUNKOFMRXQPITSXHGMSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLTDI6YUNKOFMRXQPITSXHGMSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLTDI6YUNKOFMRXQPITSXHGMSU/action/storage_attestation","attest_author":"https://pith.science/pith/SLTDI6YUNKOFMRXQPITSXHGMSU/action/author_attestation","sign_citation":"https://pith.science/pith/SLTDI6YUNKOFMRXQPITSXHGMSU/action/citation_signature","submit_replication":"https://pith.science/pith/SLTDI6YUNKOFMRXQPITSXHGMSU/action/replication_record"}},"created_at":"2026-05-18T00:42:24.481791+00:00","updated_at":"2026-05-18T00:42:24.481791+00:00"}