{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BZSX6X5KDDO2OLUINITPZEABLE","short_pith_number":"pith:BZSX6X5K","schema_version":"1.0","canonical_sha256":"0e657f5faa18dda72e886a26fc90015920aa032fe87bc78c1e32f2835a1d02f1","source":{"kind":"arxiv","id":"1706.03675","version":4},"attestation_state":"computed","paper":{"title":"Post-processing partitions to identify domains of modularity optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Dane Taylor, Peter J. Mucha, Ryan Gibson, Scott Emmons, William H. Weir","submitted_at":"2017-06-12T14:57:25Z","abstract_excerpt":"We introduce the Convex Hull of Admissible Modularity Partitions (CHAMP) algorithm to prune and prioritize different network community structures identified across multiple runs of possibly various computational heuristics. Given a set of partitions, CHAMP identifies the domain of modularity optimization for each partition ---i.e., the parameter-space domain where it has the largest modularity relative to the input set---discarding partitions with empty domains to obtain the subset of partitions that are \"admissible\" candidate community structures that remain potentially optimal over indicated"},"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.03675","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2017-06-12T14:57:25Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"eb87e07ee1d5ea5d8e050abea50efc0402ec6f1b666bfe502d84f371460733fe","abstract_canon_sha256":"2b4c9b27885b39db5d31fb678051b0195e686e81212eec51485a56c8cce98273"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:44.892354Z","signature_b64":"+76Q2/vxhPheM4fdGOByyXUHvqkmVka7YlqMi5Pna7hRnKZwV8GS5XJz5ro8Ol0LbopS7Y3aMKhxbjoRN545Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e657f5faa18dda72e886a26fc90015920aa032fe87bc78c1e32f2835a1d02f1","last_reissued_at":"2026-05-18T00:37:44.891694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:44.891694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Post-processing partitions to identify domains of modularity optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Dane Taylor, Peter J. Mucha, Ryan Gibson, Scott Emmons, William H. Weir","submitted_at":"2017-06-12T14:57:25Z","abstract_excerpt":"We introduce the Convex Hull of Admissible Modularity Partitions (CHAMP) algorithm to prune and prioritize different network community structures identified across multiple runs of possibly various computational heuristics. Given a set of partitions, CHAMP identifies the domain of modularity optimization for each partition ---i.e., the parameter-space domain where it has the largest modularity relative to the input set---discarding partitions with empty domains to obtain the subset of partitions that are \"admissible\" candidate community structures that remain potentially optimal over indicated"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03675","kind":"arxiv","version":4},"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.03675","created_at":"2026-05-18T00:37:44.891785+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03675v4","created_at":"2026-05-18T00:37:44.891785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03675","created_at":"2026-05-18T00:37:44.891785+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZSX6X5KDDO2","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZSX6X5KDDO2OLUI","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZSX6X5K","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/BZSX6X5KDDO2OLUINITPZEABLE","json":"https://pith.science/pith/BZSX6X5KDDO2OLUINITPZEABLE.json","graph_json":"https://pith.science/api/pith-number/BZSX6X5KDDO2OLUINITPZEABLE/graph.json","events_json":"https://pith.science/api/pith-number/BZSX6X5KDDO2OLUINITPZEABLE/events.json","paper":"https://pith.science/paper/BZSX6X5K"},"agent_actions":{"view_html":"https://pith.science/pith/BZSX6X5KDDO2OLUINITPZEABLE","download_json":"https://pith.science/pith/BZSX6X5KDDO2OLUINITPZEABLE.json","view_paper":"https://pith.science/paper/BZSX6X5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03675&json=true","fetch_graph":"https://pith.science/api/pith-number/BZSX6X5KDDO2OLUINITPZEABLE/graph.json","fetch_events":"https://pith.science/api/pith-number/BZSX6X5KDDO2OLUINITPZEABLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZSX6X5KDDO2OLUINITPZEABLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZSX6X5KDDO2OLUINITPZEABLE/action/storage_attestation","attest_author":"https://pith.science/pith/BZSX6X5KDDO2OLUINITPZEABLE/action/author_attestation","sign_citation":"https://pith.science/pith/BZSX6X5KDDO2OLUINITPZEABLE/action/citation_signature","submit_replication":"https://pith.science/pith/BZSX6X5KDDO2OLUINITPZEABLE/action/replication_record"}},"created_at":"2026-05-18T00:37:44.891785+00:00","updated_at":"2026-05-18T00:37:44.891785+00:00"}