{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VAMHOTK4BSRPFZ6NS4AKI7S3Q3","short_pith_number":"pith:VAMHOTK4","schema_version":"1.0","canonical_sha256":"a818774d5c0ca2f2e7cd9700a47e5b86d714b3d652088c7f074190be9d807f66","source":{"kind":"arxiv","id":"2606.07447","version":1},"attestation_state":"computed","paper":{"title":"Community Detection on a Randomly Growing Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Jianxiang Wang, Min Xu","submitted_at":"2026-06-05T16:48:38Z","abstract_excerpt":"We study community detection on Markovian random networks outside of the Stochastic Block Model (SBM) framework. Specifically, we consider a random network growth process which generates $K$ separate preferential attachment trees and connects them with Erd\\H{o}s--R\\'enyi edges, so that each tree represents a community and each node inherits the label of the tree to which it belongs. This model is able to produce many features of real world networks that are improbable under SBM, such as power law degree distribution and the existence of chains and hubs. Given only the final graph, without any "},"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":"2606.07447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-06-05T16:48:38Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"9af44bbf21008969a250343522bdeeebe921c3660fd4e1e8ab61c58cf2117c90","abstract_canon_sha256":"d7e9d5fc2909d5931f6de2afab595b08224ca7653183b7990ec956c474032dec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:27.615120Z","signature_b64":"vkZWYQYoOpvU0PHuWWZHaOh+eaLpvd7/RVA3o603CDUre3NSsPkUOUAWejGm+EHadoiOYFFK2ohWMdHbz6S+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a818774d5c0ca2f2e7cd9700a47e5b86d714b3d652088c7f074190be9d807f66","last_reissued_at":"2026-06-08T01:05:27.614283Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:27.614283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Detection on a Randomly Growing Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Jianxiang Wang, Min Xu","submitted_at":"2026-06-05T16:48:38Z","abstract_excerpt":"We study community detection on Markovian random networks outside of the Stochastic Block Model (SBM) framework. Specifically, we consider a random network growth process which generates $K$ separate preferential attachment trees and connects them with Erd\\H{o}s--R\\'enyi edges, so that each tree represents a community and each node inherits the label of the tree to which it belongs. This model is able to produce many features of real world networks that are improbable under SBM, such as power law degree distribution and the existence of chains and hubs. Given only the final graph, without any "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07447","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/2606.07447/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":"2606.07447","created_at":"2026-06-08T01:05:27.614430+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07447v1","created_at":"2026-06-08T01:05:27.614430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07447","created_at":"2026-06-08T01:05:27.614430+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAMHOTK4BSRP","created_at":"2026-06-08T01:05:27.614430+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAMHOTK4BSRPFZ6N","created_at":"2026-06-08T01:05:27.614430+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAMHOTK4","created_at":"2026-06-08T01:05:27.614430+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/VAMHOTK4BSRPFZ6NS4AKI7S3Q3","json":"https://pith.science/pith/VAMHOTK4BSRPFZ6NS4AKI7S3Q3.json","graph_json":"https://pith.science/api/pith-number/VAMHOTK4BSRPFZ6NS4AKI7S3Q3/graph.json","events_json":"https://pith.science/api/pith-number/VAMHOTK4BSRPFZ6NS4AKI7S3Q3/events.json","paper":"https://pith.science/paper/VAMHOTK4"},"agent_actions":{"view_html":"https://pith.science/pith/VAMHOTK4BSRPFZ6NS4AKI7S3Q3","download_json":"https://pith.science/pith/VAMHOTK4BSRPFZ6NS4AKI7S3Q3.json","view_paper":"https://pith.science/paper/VAMHOTK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07447&json=true","fetch_graph":"https://pith.science/api/pith-number/VAMHOTK4BSRPFZ6NS4AKI7S3Q3/graph.json","fetch_events":"https://pith.science/api/pith-number/VAMHOTK4BSRPFZ6NS4AKI7S3Q3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAMHOTK4BSRPFZ6NS4AKI7S3Q3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAMHOTK4BSRPFZ6NS4AKI7S3Q3/action/storage_attestation","attest_author":"https://pith.science/pith/VAMHOTK4BSRPFZ6NS4AKI7S3Q3/action/author_attestation","sign_citation":"https://pith.science/pith/VAMHOTK4BSRPFZ6NS4AKI7S3Q3/action/citation_signature","submit_replication":"https://pith.science/pith/VAMHOTK4BSRPFZ6NS4AKI7S3Q3/action/replication_record"}},"created_at":"2026-06-08T01:05:27.614430+00:00","updated_at":"2026-06-08T01:05:27.614430+00:00"}