{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7Q56LOYJAHQFMVYNERQDXEM2QD","short_pith_number":"pith:7Q56LOYJ","canonical_record":{"source":{"id":"1105.0974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-05T04:55:53Z","cross_cats_sorted":[],"title_canon_sha256":"5197eafab27258069639a9a838f8b64639c65b3a08c0a8cd836855377c448fb5","abstract_canon_sha256":"d297ac9237068be7b0657b61d50d451a38db44596ddfe5466c8c42332e48b929"},"schema_version":"1.0"},"canonical_sha256":"fc3be5bb0901e056570d24603b919a80c607cec81ecd1ed8d08d0d881c07e016","source":{"kind":"arxiv","id":"1105.0974","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0974","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0974v1","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0974","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"7Q56LOYJAHQF","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7Q56LOYJAHQFMVYN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7Q56LOYJ","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7Q56LOYJAHQFMVYNERQDXEM2QD","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-05T04:55:53Z","cross_cats_sorted":[],"title_canon_sha256":"5197eafab27258069639a9a838f8b64639c65b3a08c0a8cd836855377c448fb5","abstract_canon_sha256":"d297ac9237068be7b0657b61d50d451a38db44596ddfe5466c8c42332e48b929"},"schema_version":"1.0"},"canonical_sha256":"fc3be5bb0901e056570d24603b919a80c607cec81ecd1ed8d08d0d881c07e016","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:49.527406Z","signature_b64":"l1lKOiUSGVXmfM0y/XhnygCFxgURRsPkCiMSR2CHmUyDN4wZ+sqdpfxNHAxuKHOJG2r61k1jxpIcd+Q+ThxWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc3be5bb0901e056570d24603b919a80c607cec81ecd1ed8d08d0d881c07e016","last_reissued_at":"2026-05-18T04:22:49.526828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:49.526828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0974","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-18T04:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjO7hx6wgUWAQm1WY0QMScYiE30WVno3Rke8wg1Cbr1G1jyH+oriOy6rqoLcAuMEFu+QYZyv1Nzxx2gpUNoEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:55:47.712651Z"},"content_sha256":"2cbe7dc37b02fceae444cd728f351b41432671d54ad778d32e643d62c3fc8cbe","schema_version":"1.0","event_id":"sha256:2cbe7dc37b02fceae444cd728f351b41432671d54ad778d32e643d62c3fc8cbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7Q56LOYJAHQFMVYNERQDXEM2QD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GANC: Greedy Agglomerative Normalized Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mark Coates, Michael Rabbat, Seyed Salim Tabatabaei","submitted_at":"2011-05-05T04:55:53Z","abstract_excerpt":"This paper describes a graph clustering algorithm that aims to minimize the normalized cut criterion and has a model order selection procedure. The performance of the proposed algorithm is comparable to spectral approaches in terms of minimizing normalized cut. However, unlike spectral approaches, the proposed algorithm scales to graphs with millions of nodes and edges. The algorithm consists of three components that are processed sequentially: a greedy agglomerative hierarchical clustering procedure, model order selection, and a local refinement.\n  For a graph of n nodes and O(n) edges, the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0974","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-18T04:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJDb9TePX9Gxqf6eCW5oVt1RmqFmv+Z/LVwyLQTBx670PgMT+CkYe7z6o/X/yI6ThULrrPxb7MN8R9lxAlGnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:55:47.713367Z"},"content_sha256":"d49847583dc51d44ee6a557491b0c388148a4a57cd5cbfc5e1becf4239a796a3","schema_version":"1.0","event_id":"sha256:d49847583dc51d44ee6a557491b0c388148a4a57cd5cbfc5e1becf4239a796a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Q56LOYJAHQFMVYNERQDXEM2QD/bundle.json","state_url":"https://pith.science/pith/7Q56LOYJAHQFMVYNERQDXEM2QD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Q56LOYJAHQFMVYNERQDXEM2QD/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-06-10T16:55:47Z","links":{"resolver":"https://pith.science/pith/7Q56LOYJAHQFMVYNERQDXEM2QD","bundle":"https://pith.science/pith/7Q56LOYJAHQFMVYNERQDXEM2QD/bundle.json","state":"https://pith.science/pith/7Q56LOYJAHQFMVYNERQDXEM2QD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Q56LOYJAHQFMVYNERQDXEM2QD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7Q56LOYJAHQFMVYNERQDXEM2QD","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":"d297ac9237068be7b0657b61d50d451a38db44596ddfe5466c8c42332e48b929","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-05T04:55:53Z","title_canon_sha256":"5197eafab27258069639a9a838f8b64639c65b3a08c0a8cd836855377c448fb5"},"schema_version":"1.0","source":{"id":"1105.0974","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0974","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0974v1","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0974","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"7Q56LOYJAHQF","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7Q56LOYJAHQFMVYN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7Q56LOYJ","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:d49847583dc51d44ee6a557491b0c388148a4a57cd5cbfc5e1becf4239a796a3","target":"graph","created_at":"2026-05-18T04:22:49Z","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":"This paper describes a graph clustering algorithm that aims to minimize the normalized cut criterion and has a model order selection procedure. The performance of the proposed algorithm is comparable to spectral approaches in terms of minimizing normalized cut. However, unlike spectral approaches, the proposed algorithm scales to graphs with millions of nodes and edges. The algorithm consists of three components that are processed sequentially: a greedy agglomerative hierarchical clustering procedure, model order selection, and a local refinement.\n  For a graph of n nodes and O(n) edges, the c","authors_text":"Mark Coates, Michael Rabbat, Seyed Salim Tabatabaei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-05T04:55:53Z","title":"GANC: Greedy Agglomerative Normalized Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0974","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:2cbe7dc37b02fceae444cd728f351b41432671d54ad778d32e643d62c3fc8cbe","target":"record","created_at":"2026-05-18T04:22:49Z","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":"d297ac9237068be7b0657b61d50d451a38db44596ddfe5466c8c42332e48b929","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-05T04:55:53Z","title_canon_sha256":"5197eafab27258069639a9a838f8b64639c65b3a08c0a8cd836855377c448fb5"},"schema_version":"1.0","source":{"id":"1105.0974","kind":"arxiv","version":1}},"canonical_sha256":"fc3be5bb0901e056570d24603b919a80c607cec81ecd1ed8d08d0d881c07e016","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc3be5bb0901e056570d24603b919a80c607cec81ecd1ed8d08d0d881c07e016","first_computed_at":"2026-05-18T04:22:49.526828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:49.526828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l1lKOiUSGVXmfM0y/XhnygCFxgURRsPkCiMSR2CHmUyDN4wZ+sqdpfxNHAxuKHOJG2r61k1jxpIcd+Q+ThxWDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:49.527406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0974","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cbe7dc37b02fceae444cd728f351b41432671d54ad778d32e643d62c3fc8cbe","sha256:d49847583dc51d44ee6a557491b0c388148a4a57cd5cbfc5e1becf4239a796a3"],"state_sha256":"7d20affc82b51daf723801487e198f5eebda56337767ff07404c1accfb1a1878"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Am9LBiZMyLo2Wx5iqJBGVw0IgS/OKILPIxonKOJfP3/IywdH/SNAqHgKEPYa03gXG5UjTzSURQcOLimRRhR4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:55:47.723779Z","bundle_sha256":"bbccdbcc7c646d781da05d74cfeab7229dcb1c53f3038d25229589dbbeff9737"}}