{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B7ZBFSPV7QST2FTKVLE3NXWZZ5","short_pith_number":"pith:B7ZBFSPV","schema_version":"1.0","canonical_sha256":"0ff212c9f5fc253d166aaac9b6ded9cf4c897feea860dcb3526a8920f8362748","source":{"kind":"arxiv","id":"1708.05569","version":2},"attestation_state":"computed","paper":{"title":"Community detection in networks via nonlinear modularity eigenvectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.SI","authors_text":"Francesco Tudisco, Matthias Hein, Pedro Mercado","submitted_at":"2017-08-18T11:43:21Z","abstract_excerpt":"Revealing a community structure in a network or dataset is a central problem arising in many scientific areas. The modularity function $Q$ is an established measure quantifying the quality of a community, being identified as a set of nodes having high modularity. In our terminology, a set of nodes with positive modularity is called a \\textit{module} and a set that maximizes $Q$ is thus called \\textit{leading module}. Finding a leading module in a network is an important task, however the dimension of real-world problems makes the maximization of $Q$ unfeasible. This poses the need of approxima"},"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":"1708.05569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-08-18T11:43:21Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"299f15d039cd9086fecb96aa65a8b76a78d23fba6ae9ca627f30d5ade611a2b6","abstract_canon_sha256":"2fdfebcd97ca15e0c2fdc853467c5d8488824c22afffdb4b84c7bf1344bbd7f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:56.656236Z","signature_b64":"U50mWw75VCg8/hssMygwrMpj9gH7B+uq6tPs1Ahk+RXGIFAMvWBYUOn0aX++k4lFPKKwX7FLaNIQvTaBHKc2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ff212c9f5fc253d166aaac9b6ded9cf4c897feea860dcb3526a8920f8362748","last_reissued_at":"2026-05-18T00:05:56.655770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:56.655770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community detection in networks via nonlinear modularity eigenvectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.SI","authors_text":"Francesco Tudisco, Matthias Hein, Pedro Mercado","submitted_at":"2017-08-18T11:43:21Z","abstract_excerpt":"Revealing a community structure in a network or dataset is a central problem arising in many scientific areas. The modularity function $Q$ is an established measure quantifying the quality of a community, being identified as a set of nodes having high modularity. In our terminology, a set of nodes with positive modularity is called a \\textit{module} and a set that maximizes $Q$ is thus called \\textit{leading module}. Finding a leading module in a network is an important task, however the dimension of real-world problems makes the maximization of $Q$ unfeasible. This poses the need of approxima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05569","kind":"arxiv","version":2},"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":"1708.05569","created_at":"2026-05-18T00:05:56.655847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05569v2","created_at":"2026-05-18T00:05:56.655847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05569","created_at":"2026-05-18T00:05:56.655847+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7ZBFSPV7QST","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7ZBFSPV7QST2FTK","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7ZBFSPV","created_at":"2026-05-18T12:31:08.081275+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/B7ZBFSPV7QST2FTKVLE3NXWZZ5","json":"https://pith.science/pith/B7ZBFSPV7QST2FTKVLE3NXWZZ5.json","graph_json":"https://pith.science/api/pith-number/B7ZBFSPV7QST2FTKVLE3NXWZZ5/graph.json","events_json":"https://pith.science/api/pith-number/B7ZBFSPV7QST2FTKVLE3NXWZZ5/events.json","paper":"https://pith.science/paper/B7ZBFSPV"},"agent_actions":{"view_html":"https://pith.science/pith/B7ZBFSPV7QST2FTKVLE3NXWZZ5","download_json":"https://pith.science/pith/B7ZBFSPV7QST2FTKVLE3NXWZZ5.json","view_paper":"https://pith.science/paper/B7ZBFSPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05569&json=true","fetch_graph":"https://pith.science/api/pith-number/B7ZBFSPV7QST2FTKVLE3NXWZZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/B7ZBFSPV7QST2FTKVLE3NXWZZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7ZBFSPV7QST2FTKVLE3NXWZZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7ZBFSPV7QST2FTKVLE3NXWZZ5/action/storage_attestation","attest_author":"https://pith.science/pith/B7ZBFSPV7QST2FTKVLE3NXWZZ5/action/author_attestation","sign_citation":"https://pith.science/pith/B7ZBFSPV7QST2FTKVLE3NXWZZ5/action/citation_signature","submit_replication":"https://pith.science/pith/B7ZBFSPV7QST2FTKVLE3NXWZZ5/action/replication_record"}},"created_at":"2026-05-18T00:05:56.655847+00:00","updated_at":"2026-05-18T00:05:56.655847+00:00"}