{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YMV5UZQXPHFEZC5MRXATGNTUE4","short_pith_number":"pith:YMV5UZQX","canonical_record":{"source":{"id":"1608.03860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-12T17:57:53Z","cross_cats_sorted":["math.SP","math.ST","stat.TH"],"title_canon_sha256":"9932ed92d6c72ac9df6207ce13076ea20ed1c995c58662ebe08c43f21652c5b6","abstract_canon_sha256":"ac3c8d085e39f81e5952863f4459a0d65da0cbde6eb93c23b11d8047d1bca875"},"schema_version":"1.0"},"canonical_sha256":"c32bda661779ca4c8bac8dc13336742734858ee75b72df08a0892db7163e9768","source":{"kind":"arxiv","id":"1608.03860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03860","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03860v1","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03860","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"YMV5UZQXPHFE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YMV5UZQXPHFEZC5M","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YMV5UZQX","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YMV5UZQXPHFEZC5MRXATGNTUE4","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-12T17:57:53Z","cross_cats_sorted":["math.SP","math.ST","stat.TH"],"title_canon_sha256":"9932ed92d6c72ac9df6207ce13076ea20ed1c995c58662ebe08c43f21652c5b6","abstract_canon_sha256":"ac3c8d085e39f81e5952863f4459a0d65da0cbde6eb93c23b11d8047d1bca875"},"schema_version":"1.0"},"canonical_sha256":"c32bda661779ca4c8bac8dc13336742734858ee75b72df08a0892db7163e9768","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:11.160616Z","signature_b64":"gYCLvwmLP74w0NWXncjO21O6fyg0CtpkhTUA2ScStSEmxkoAM+H2VnbosOWLcCHw9K6z6sHHkgfcYuAVoxuoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c32bda661779ca4c8bac8dc13336742734858ee75b72df08a0892db7163e9768","last_reissued_at":"2026-05-18T01:09:11.160053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:11.160053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03860","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:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KeTpkVGab2qiCmZ25AjCCHhb4TMyH7hoQKMwYx/d4e2ajiH761SY6jAlWjc1/AUAMSCVxAdJ6pTQjHzXoSoOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:54:19.380848Z"},"content_sha256":"1c53f156d6ef7c64357fa4f0d9bc61682e5ff1b2925c6c418e1c0cd44e482e42","schema_version":"1.0","event_id":"sha256:1c53f156d6ef7c64357fa4f0d9bc61682e5ff1b2925c6c418e1c0cd44e482e42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YMV5UZQXPHFEZC5MRXATGNTUE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model-free consistency of graph partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP","math.ST","stat.TH"],"primary_cat":"math.CO","authors_text":"Apoorva Khare, Bala Rajaratnam, Dominique Guillot, Peter Diao","submitted_at":"2016-08-12T17:57:53Z","abstract_excerpt":"In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic consistency (i.e., convergence with probability $1$ as the sample size goes to infinity under a fixed probability model) follow from our notion of structural consistency. By formulating structural consistency as a continuity result on the graphon space, we obtain robust results that are completely independent of the data generating mechanism. In particular, our re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03860","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:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hO1xBtH68apwvn2065QXNd0/LS2ZBNdcV5a91C4s9/UAaqMVmDBkYqJo92pnNoCToxDZFfaRpJHoi9MuGpbyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:54:19.381493Z"},"content_sha256":"af63e8bd7ef10a8bd552539b985942c841e5b598db08f42629bf710f7fbbc582","schema_version":"1.0","event_id":"sha256:af63e8bd7ef10a8bd552539b985942c841e5b598db08f42629bf710f7fbbc582"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMV5UZQXPHFEZC5MRXATGNTUE4/bundle.json","state_url":"https://pith.science/pith/YMV5UZQXPHFEZC5MRXATGNTUE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMV5UZQXPHFEZC5MRXATGNTUE4/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-01T21:54:19Z","links":{"resolver":"https://pith.science/pith/YMV5UZQXPHFEZC5MRXATGNTUE4","bundle":"https://pith.science/pith/YMV5UZQXPHFEZC5MRXATGNTUE4/bundle.json","state":"https://pith.science/pith/YMV5UZQXPHFEZC5MRXATGNTUE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMV5UZQXPHFEZC5MRXATGNTUE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YMV5UZQXPHFEZC5MRXATGNTUE4","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":"ac3c8d085e39f81e5952863f4459a0d65da0cbde6eb93c23b11d8047d1bca875","cross_cats_sorted":["math.SP","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-12T17:57:53Z","title_canon_sha256":"9932ed92d6c72ac9df6207ce13076ea20ed1c995c58662ebe08c43f21652c5b6"},"schema_version":"1.0","source":{"id":"1608.03860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03860","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03860v1","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03860","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"YMV5UZQXPHFE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YMV5UZQXPHFEZC5M","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YMV5UZQX","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:af63e8bd7ef10a8bd552539b985942c841e5b598db08f42629bf710f7fbbc582","target":"graph","created_at":"2026-05-18T01:09:11Z","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":"In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic consistency (i.e., convergence with probability $1$ as the sample size goes to infinity under a fixed probability model) follow from our notion of structural consistency. By formulating structural consistency as a continuity result on the graphon space, we obtain robust results that are completely independent of the data generating mechanism. In particular, our re","authors_text":"Apoorva Khare, Bala Rajaratnam, Dominique Guillot, Peter Diao","cross_cats":["math.SP","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-12T17:57:53Z","title":"Model-free consistency of graph partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03860","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:1c53f156d6ef7c64357fa4f0d9bc61682e5ff1b2925c6c418e1c0cd44e482e42","target":"record","created_at":"2026-05-18T01:09:11Z","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":"ac3c8d085e39f81e5952863f4459a0d65da0cbde6eb93c23b11d8047d1bca875","cross_cats_sorted":["math.SP","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-12T17:57:53Z","title_canon_sha256":"9932ed92d6c72ac9df6207ce13076ea20ed1c995c58662ebe08c43f21652c5b6"},"schema_version":"1.0","source":{"id":"1608.03860","kind":"arxiv","version":1}},"canonical_sha256":"c32bda661779ca4c8bac8dc13336742734858ee75b72df08a0892db7163e9768","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c32bda661779ca4c8bac8dc13336742734858ee75b72df08a0892db7163e9768","first_computed_at":"2026-05-18T01:09:11.160053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:11.160053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gYCLvwmLP74w0NWXncjO21O6fyg0CtpkhTUA2ScStSEmxkoAM+H2VnbosOWLcCHw9K6z6sHHkgfcYuAVoxuoBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:11.160616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c53f156d6ef7c64357fa4f0d9bc61682e5ff1b2925c6c418e1c0cd44e482e42","sha256:af63e8bd7ef10a8bd552539b985942c841e5b598db08f42629bf710f7fbbc582"],"state_sha256":"07f33fcb5d74c0bf7f53d7f29b7f6a93223fcd87aa405bf4ec79bf6e9f88d249"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwhqVYvptPMIoeRivL2YCJ7v4tPH9r1bS5woIRU7Ivkn4X7aeQzyizBE8rGAtZAX/9tFAmhstNslyeK81qIODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:54:19.384531Z","bundle_sha256":"edc493bda0fed55bfca4eedb8862b4a81f241036f5991bc17cff513b06a1aacc"}}