{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EJ64YZPIJDB34IQL4V5YSTPFTB","short_pith_number":"pith:EJ64YZPI","schema_version":"1.0","canonical_sha256":"227dcc65e848c3be220be57b894de59854769d564ec7b988fb66dbd15a3b2b22","source":{"kind":"arxiv","id":"2508.04730","version":1},"attestation_state":"computed","paper":{"title":"Statistical inference for core-periphery structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Diganta Mukherjee, Eric Yanchenko, Srijan Sengupta","submitted_at":"2025-08-05T20:31:46Z","abstract_excerpt":"Core-periphery (CP) structure is an important meso-scale network property where nodes group into a small, densely interconnected {core} and a sparse {periphery} whose members primarily connect to the core rather than to each other. While this structure has been observed in numerous real-world networks, there has been minimal statistical formalization of it. In this work, we develop a statistical framework for CP structures by introducing a model-agnostic and generalizable population parameter which quantifies the strength of a CP structure at the level of the data-generating mechanism. We stud"},"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":"2508.04730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-08-05T20:31:46Z","cross_cats_sorted":[],"title_canon_sha256":"4c624bf78d0139a4a8a2f69597e6b7d667aac46fd0c4a4250464f21747fe9683","abstract_canon_sha256":"654450a0706872de9f86c0a871aa480ffb9ee04f2eb245211c988fdf206fa3ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:00.739153Z","signature_b64":"Z5A44fW8p20j7vn0qje1OcHKrVsXMAbEHKMKCjy+1tQdRhPBdaw71gTTQXHUUjuaNmEZ4Txjyhoe69y/gOH1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"227dcc65e848c3be220be57b894de59854769d564ec7b988fb66dbd15a3b2b22","last_reissued_at":"2026-07-05T11:50:00.738651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:00.738651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical inference for core-periphery structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Diganta Mukherjee, Eric Yanchenko, Srijan Sengupta","submitted_at":"2025-08-05T20:31:46Z","abstract_excerpt":"Core-periphery (CP) structure is an important meso-scale network property where nodes group into a small, densely interconnected {core} and a sparse {periphery} whose members primarily connect to the core rather than to each other. While this structure has been observed in numerous real-world networks, there has been minimal statistical formalization of it. In this work, we develop a statistical framework for CP structures by introducing a model-agnostic and generalizable population parameter which quantifies the strength of a CP structure at the level of the data-generating mechanism. We stud"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.04730","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/2508.04730/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":"2508.04730","created_at":"2026-07-05T11:50:00.738712+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.04730v1","created_at":"2026-07-05T11:50:00.738712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.04730","created_at":"2026-07-05T11:50:00.738712+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJ64YZPIJDB3","created_at":"2026-07-05T11:50:00.738712+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJ64YZPIJDB34IQL","created_at":"2026-07-05T11:50:00.738712+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJ64YZPI","created_at":"2026-07-05T11:50:00.738712+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07447","citing_title":"Community Detection on a Randomly Growing Network","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30981","citing_title":"Universal Inference for model selection on networks","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EJ64YZPIJDB34IQL4V5YSTPFTB","json":"https://pith.science/pith/EJ64YZPIJDB34IQL4V5YSTPFTB.json","graph_json":"https://pith.science/api/pith-number/EJ64YZPIJDB34IQL4V5YSTPFTB/graph.json","events_json":"https://pith.science/api/pith-number/EJ64YZPIJDB34IQL4V5YSTPFTB/events.json","paper":"https://pith.science/paper/EJ64YZPI"},"agent_actions":{"view_html":"https://pith.science/pith/EJ64YZPIJDB34IQL4V5YSTPFTB","download_json":"https://pith.science/pith/EJ64YZPIJDB34IQL4V5YSTPFTB.json","view_paper":"https://pith.science/paper/EJ64YZPI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.04730&json=true","fetch_graph":"https://pith.science/api/pith-number/EJ64YZPIJDB34IQL4V5YSTPFTB/graph.json","fetch_events":"https://pith.science/api/pith-number/EJ64YZPIJDB34IQL4V5YSTPFTB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJ64YZPIJDB34IQL4V5YSTPFTB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJ64YZPIJDB34IQL4V5YSTPFTB/action/storage_attestation","attest_author":"https://pith.science/pith/EJ64YZPIJDB34IQL4V5YSTPFTB/action/author_attestation","sign_citation":"https://pith.science/pith/EJ64YZPIJDB34IQL4V5YSTPFTB/action/citation_signature","submit_replication":"https://pith.science/pith/EJ64YZPIJDB34IQL4V5YSTPFTB/action/replication_record"}},"created_at":"2026-07-05T11:50:00.738712+00:00","updated_at":"2026-07-05T11:50:00.738712+00:00"}