{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:I3CV72LKRCXHMP52O7RI5RWITR","short_pith_number":"pith:I3CV72LK","canonical_record":{"source":{"id":"1609.06457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-21T08:14:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"72e35e5aea196726c86db26107199482c8c084a9e61f3ab160b4ba45ad61bee9","abstract_canon_sha256":"1847190062c629e28c314bf6278989f91b89dc99a8da6373c33505aaef055348"},"schema_version":"1.0"},"canonical_sha256":"46c55fe96a88ae763fba77e28ec6c89c4f482c91678fbab4b23fff6707e9ed24","source":{"kind":"arxiv","id":"1609.06457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06457","created_at":"2026-05-18T01:04:08Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06457v1","created_at":"2026-05-18T01:04:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06457","created_at":"2026-05-18T01:04:08Z"},{"alias_kind":"pith_short_12","alias_value":"I3CV72LKRCXH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I3CV72LKRCXHMP52","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I3CV72LK","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:I3CV72LKRCXHMP52O7RI5RWITR","target":"record","payload":{"canonical_record":{"source":{"id":"1609.06457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-21T08:14:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"72e35e5aea196726c86db26107199482c8c084a9e61f3ab160b4ba45ad61bee9","abstract_canon_sha256":"1847190062c629e28c314bf6278989f91b89dc99a8da6373c33505aaef055348"},"schema_version":"1.0"},"canonical_sha256":"46c55fe96a88ae763fba77e28ec6c89c4f482c91678fbab4b23fff6707e9ed24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:08.240777Z","signature_b64":"s+gbOK5p12tqbwixWx5xJcErjwPpeGoSjCyxHjxwsqx1GfFM8SnktIOo0JljUpLUq0I6R6z/+AHGiw41kY2EDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46c55fe96a88ae763fba77e28ec6c89c4f482c91678fbab4b23fff6707e9ed24","last_reissued_at":"2026-05-18T01:04:08.240145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:08.240145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.06457","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e8uZAnGSAxtO6p3rpTHL4oyipy5QZnTwEqugy//juWL8czkbfHKbdgK9cxThFVCVYF+Ehe2jrLzh7G0VwZlZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:17:05.786945Z"},"content_sha256":"899f318a0a127a6d3058740432b5b11b289acdf273682b7c6d36efbc54d5194b","schema_version":"1.0","event_id":"sha256:899f318a0a127a6d3058740432b5b11b289acdf273682b7c6d36efbc54d5194b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:I3CV72LKRCXHMP52O7RI5RWITR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AMOS: An Automated Model Order Selection Algorithm for Spectral Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Alfred O. Hero III, Pin-Yu Chen, Thibaut Gensollen","submitted_at":"2016-09-21T08:14:12Z","abstract_excerpt":"One of the longstanding problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters. This is equivalent to the problem of finding the number of connected components or communities in an undirected graph. In this paper, we propose AMOS, an automated model order selection algorithm for SGC. Based on a recent analysis of clustering reliability for SGC under the random interconnection model, AMOS works by incrementally increasing the number of clusters, estimating the quality of identified clusters, and providing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06457","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQRSSxMtj0wC0qJI6oYjppA5DTKVpQmP3jghvOZGt2/2O5pmb6HBJJAAWLCdr4bOdxR2WQhwXt5P6mQ79S68Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:17:05.787496Z"},"content_sha256":"12334245d5bd3344d2e56ca8f8d59930165025a8e9f41071581428c53cd5002a","schema_version":"1.0","event_id":"sha256:12334245d5bd3344d2e56ca8f8d59930165025a8e9f41071581428c53cd5002a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3CV72LKRCXHMP52O7RI5RWITR/bundle.json","state_url":"https://pith.science/pith/I3CV72LKRCXHMP52O7RI5RWITR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3CV72LKRCXHMP52O7RI5RWITR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T07:17:05Z","links":{"resolver":"https://pith.science/pith/I3CV72LKRCXHMP52O7RI5RWITR","bundle":"https://pith.science/pith/I3CV72LKRCXHMP52O7RI5RWITR/bundle.json","state":"https://pith.science/pith/I3CV72LKRCXHMP52O7RI5RWITR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3CV72LKRCXHMP52O7RI5RWITR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:I3CV72LKRCXHMP52O7RI5RWITR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1847190062c629e28c314bf6278989f91b89dc99a8da6373c33505aaef055348","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-21T08:14:12Z","title_canon_sha256":"72e35e5aea196726c86db26107199482c8c084a9e61f3ab160b4ba45ad61bee9"},"schema_version":"1.0","source":{"id":"1609.06457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06457","created_at":"2026-05-18T01:04:08Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06457v1","created_at":"2026-05-18T01:04:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06457","created_at":"2026-05-18T01:04:08Z"},{"alias_kind":"pith_short_12","alias_value":"I3CV72LKRCXH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I3CV72LKRCXHMP52","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I3CV72LK","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:12334245d5bd3344d2e56ca8f8d59930165025a8e9f41071581428c53cd5002a","target":"graph","created_at":"2026-05-18T01:04:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"One of the longstanding problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters. This is equivalent to the problem of finding the number of connected components or communities in an undirected graph. In this paper, we propose AMOS, an automated model order selection algorithm for SGC. Based on a recent analysis of clustering reliability for SGC under the random interconnection model, AMOS works by incrementally increasing the number of clusters, estimating the quality of identified clusters, and providing","authors_text":"Alfred O. Hero III, Pin-Yu Chen, Thibaut Gensollen","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-21T08:14:12Z","title":"AMOS: An Automated Model Order Selection Algorithm for Spectral Graph Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06457","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:899f318a0a127a6d3058740432b5b11b289acdf273682b7c6d36efbc54d5194b","target":"record","created_at":"2026-05-18T01:04:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1847190062c629e28c314bf6278989f91b89dc99a8da6373c33505aaef055348","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-21T08:14:12Z","title_canon_sha256":"72e35e5aea196726c86db26107199482c8c084a9e61f3ab160b4ba45ad61bee9"},"schema_version":"1.0","source":{"id":"1609.06457","kind":"arxiv","version":1}},"canonical_sha256":"46c55fe96a88ae763fba77e28ec6c89c4f482c91678fbab4b23fff6707e9ed24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46c55fe96a88ae763fba77e28ec6c89c4f482c91678fbab4b23fff6707e9ed24","first_computed_at":"2026-05-18T01:04:08.240145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:08.240145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s+gbOK5p12tqbwixWx5xJcErjwPpeGoSjCyxHjxwsqx1GfFM8SnktIOo0JljUpLUq0I6R6z/+AHGiw41kY2EDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:08.240777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:899f318a0a127a6d3058740432b5b11b289acdf273682b7c6d36efbc54d5194b","sha256:12334245d5bd3344d2e56ca8f8d59930165025a8e9f41071581428c53cd5002a"],"state_sha256":"ce34c1392a99bfa21ce7a8b547e105f17c4148cd294e58021da56ff89ea67614"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/fUtYA62Oc6bpCFuGogvAtKQgvFfdslH6WyAa7w0r2Fg00Mt4wTmQpfdaBITiUxxe65Cu9gLXDjXhN48SJffBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:17:05.790555Z","bundle_sha256":"c281d0f6790a1b3eb864c0b2f37d5a1c1180b5b9e845769105d05fbb32ee1c79"}}