{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZF4JTW45ZD4RHBFBL2IUFCRTDO","short_pith_number":"pith:ZF4JTW45","schema_version":"1.0","canonical_sha256":"c97899db9dc8f91384a15e91428a331bac9314bc19e329787514c7f776ebeab3","source":{"kind":"arxiv","id":"1509.07535","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Nonparametric Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ME","authors_text":"Rehan Akbani, Sayantan Banerjee, Veerabhadran Baladandayuthapani","submitted_at":"2015-09-24T20:52:05Z","abstract_excerpt":"We present clustering methods for multivariate data exploiting the underlying geometry of the graphical structure between variables. As opposed to standard approaches that assume known graph structures, we first estimate the edge structure of the unknown graph using Bayesian neighborhood selection approaches, wherein we account for the uncertainty of graphical structure learning through model-averaged estimates of the suitable parameters. Subsequently, we develop a nonparametric graph clustering model on the lower dimensional projections of the graph based on Laplacian embeddings using Dirichl"},"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":"1509.07535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-09-24T20:52:05Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"bbafdf535e477d9dc093ee2ff15a756923ec896293c1277156181e4c5c1e9592","abstract_canon_sha256":"5413d7010db6462205c687e35c9b4d93b7b9aa412c9910bf4af2af6cff6e377d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:02.550942Z","signature_b64":"k7h28KVVXSjLxDiWpF2hKiqlh3xcUKybV0+9JVCx+v3/SxsQAhZcUcDqnUFlz0L6w06CQyfeICfo6PYwtjnoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c97899db9dc8f91384a15e91428a331bac9314bc19e329787514c7f776ebeab3","last_reissued_at":"2026-05-18T01:32:02.550472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:02.550472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Nonparametric Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ME","authors_text":"Rehan Akbani, Sayantan Banerjee, Veerabhadran Baladandayuthapani","submitted_at":"2015-09-24T20:52:05Z","abstract_excerpt":"We present clustering methods for multivariate data exploiting the underlying geometry of the graphical structure between variables. As opposed to standard approaches that assume known graph structures, we first estimate the edge structure of the unknown graph using Bayesian neighborhood selection approaches, wherein we account for the uncertainty of graphical structure learning through model-averaged estimates of the suitable parameters. Subsequently, we develop a nonparametric graph clustering model on the lower dimensional projections of the graph based on Laplacian embeddings using Dirichl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07535","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":"1509.07535","created_at":"2026-05-18T01:32:02.550562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07535v1","created_at":"2026-05-18T01:32:02.550562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07535","created_at":"2026-05-18T01:32:02.550562+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZF4JTW45ZD4R","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZF4JTW45ZD4RHBFB","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZF4JTW45","created_at":"2026-05-18T12:29:52.810259+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/ZF4JTW45ZD4RHBFBL2IUFCRTDO","json":"https://pith.science/pith/ZF4JTW45ZD4RHBFBL2IUFCRTDO.json","graph_json":"https://pith.science/api/pith-number/ZF4JTW45ZD4RHBFBL2IUFCRTDO/graph.json","events_json":"https://pith.science/api/pith-number/ZF4JTW45ZD4RHBFBL2IUFCRTDO/events.json","paper":"https://pith.science/paper/ZF4JTW45"},"agent_actions":{"view_html":"https://pith.science/pith/ZF4JTW45ZD4RHBFBL2IUFCRTDO","download_json":"https://pith.science/pith/ZF4JTW45ZD4RHBFBL2IUFCRTDO.json","view_paper":"https://pith.science/paper/ZF4JTW45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07535&json=true","fetch_graph":"https://pith.science/api/pith-number/ZF4JTW45ZD4RHBFBL2IUFCRTDO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZF4JTW45ZD4RHBFBL2IUFCRTDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZF4JTW45ZD4RHBFBL2IUFCRTDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZF4JTW45ZD4RHBFBL2IUFCRTDO/action/storage_attestation","attest_author":"https://pith.science/pith/ZF4JTW45ZD4RHBFBL2IUFCRTDO/action/author_attestation","sign_citation":"https://pith.science/pith/ZF4JTW45ZD4RHBFBL2IUFCRTDO/action/citation_signature","submit_replication":"https://pith.science/pith/ZF4JTW45ZD4RHBFBL2IUFCRTDO/action/replication_record"}},"created_at":"2026-05-18T01:32:02.550562+00:00","updated_at":"2026-05-18T01:32:02.550562+00:00"}