{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R4IQKAGOSAB4QWHG5XJWRYDNMZ","short_pith_number":"pith:R4IQKAGO","canonical_record":{"source":{"id":"1812.11564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-30T16:08:13Z","cross_cats_sorted":[],"title_canon_sha256":"8a3c8b378dd734613b238f67fd24bd10bb1dc66667f5003c730c58df0e900de9","abstract_canon_sha256":"5bcf2cfb28cec1bb04f093232633b199740b465cd75375ec69b6a4cfe2dad882"},"schema_version":"1.0"},"canonical_sha256":"8f110500ce9003c858e6edd368e06d665febc6ad5a8a99ce0f3042f74a7098c9","source":{"kind":"arxiv","id":"1812.11564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11564","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11564v1","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11564","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"pith_short_12","alias_value":"R4IQKAGOSAB4","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R4IQKAGOSAB4QWHG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R4IQKAGO","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R4IQKAGOSAB4QWHG5XJWRYDNMZ","target":"record","payload":{"canonical_record":{"source":{"id":"1812.11564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-30T16:08:13Z","cross_cats_sorted":[],"title_canon_sha256":"8a3c8b378dd734613b238f67fd24bd10bb1dc66667f5003c730c58df0e900de9","abstract_canon_sha256":"5bcf2cfb28cec1bb04f093232633b199740b465cd75375ec69b6a4cfe2dad882"},"schema_version":"1.0"},"canonical_sha256":"8f110500ce9003c858e6edd368e06d665febc6ad5a8a99ce0f3042f74a7098c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:11.640548Z","signature_b64":"U5YLkze9VwwUBZvLAHrtyLheUxo3nnVosdCeIVp5xLoBo3XCbAjb3V1FoZN0zfeiOj85AP5F+AUBHi/v33SzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f110500ce9003c858e6edd368e06d665febc6ad5a8a99ce0f3042f74a7098c9","last_reissued_at":"2026-05-17T23:57:11.639987Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:11.639987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.11564","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-17T23:57:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njatC+R7Z3AQHIr2bKG3yga2pbrwsM7KxAqTzI4L/J4VqAf5Mq6Y0w5VBC80FfND9cHDKf3ECaWo8y2b1uXqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:51:12.052443Z"},"content_sha256":"29643c69efe955e87fb7ec29c5b64813c3d018602b7a7d592b1e709e9df09587","schema_version":"1.0","event_id":"sha256:29643c69efe955e87fb7ec29c5b64813c3d018602b7a7d592b1e709e9df09587"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R4IQKAGOSAB4QWHG5XJWRYDNMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral methods for testing cluster structure of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jonathan Tidor, Sandeep Silwal","submitted_at":"2018-12-30T16:08:13Z","abstract_excerpt":"In the framework of graph property testing, we study the problem of determining if a graph admits a cluster structure. We say that a graph is $(k, \\phi)$-clusterable if it can be partitioned into at most $k$ parts such that each part has conductance at least $\\phi$. We present an algorithm that accepts all graphs that are $(2, \\phi)$-clusterable with probability at least $\\frac{2}3$ and rejects all graphs that are $\\epsilon$-far from $(2, \\phi^*)$-clusterable for $\\phi^* \\le \\mu \\phi^2 \\epsilon^2$ with probability at least $\\frac{2}3$ where $\\mu > 0$ is a parameter that affects the query compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11564","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-17T23:57:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BMgTLtXXwpY3k/0nj9ZWwyAFi7fDexs3dCP6z6pl2o73zllyLRz2345c+kAC5pDcYuECazC7ZRxpBVQxBsapCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:51:12.052785Z"},"content_sha256":"cf0d5a795d34a0c705fc616cb7a41a8700426e68ead70cad101cb57dd1a90f58","schema_version":"1.0","event_id":"sha256:cf0d5a795d34a0c705fc616cb7a41a8700426e68ead70cad101cb57dd1a90f58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R4IQKAGOSAB4QWHG5XJWRYDNMZ/bundle.json","state_url":"https://pith.science/pith/R4IQKAGOSAB4QWHG5XJWRYDNMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R4IQKAGOSAB4QWHG5XJWRYDNMZ/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-02T07:51:12Z","links":{"resolver":"https://pith.science/pith/R4IQKAGOSAB4QWHG5XJWRYDNMZ","bundle":"https://pith.science/pith/R4IQKAGOSAB4QWHG5XJWRYDNMZ/bundle.json","state":"https://pith.science/pith/R4IQKAGOSAB4QWHG5XJWRYDNMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R4IQKAGOSAB4QWHG5XJWRYDNMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R4IQKAGOSAB4QWHG5XJWRYDNMZ","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":"5bcf2cfb28cec1bb04f093232633b199740b465cd75375ec69b6a4cfe2dad882","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-30T16:08:13Z","title_canon_sha256":"8a3c8b378dd734613b238f67fd24bd10bb1dc66667f5003c730c58df0e900de9"},"schema_version":"1.0","source":{"id":"1812.11564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11564","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11564v1","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11564","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"pith_short_12","alias_value":"R4IQKAGOSAB4","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R4IQKAGOSAB4QWHG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R4IQKAGO","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:cf0d5a795d34a0c705fc616cb7a41a8700426e68ead70cad101cb57dd1a90f58","target":"graph","created_at":"2026-05-17T23:57: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 the framework of graph property testing, we study the problem of determining if a graph admits a cluster structure. We say that a graph is $(k, \\phi)$-clusterable if it can be partitioned into at most $k$ parts such that each part has conductance at least $\\phi$. We present an algorithm that accepts all graphs that are $(2, \\phi)$-clusterable with probability at least $\\frac{2}3$ and rejects all graphs that are $\\epsilon$-far from $(2, \\phi^*)$-clusterable for $\\phi^* \\le \\mu \\phi^2 \\epsilon^2$ with probability at least $\\frac{2}3$ where $\\mu > 0$ is a parameter that affects the query compl","authors_text":"Jonathan Tidor, Sandeep Silwal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-30T16:08:13Z","title":"Spectral methods for testing cluster structure of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11564","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:29643c69efe955e87fb7ec29c5b64813c3d018602b7a7d592b1e709e9df09587","target":"record","created_at":"2026-05-17T23:57: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":"5bcf2cfb28cec1bb04f093232633b199740b465cd75375ec69b6a4cfe2dad882","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-30T16:08:13Z","title_canon_sha256":"8a3c8b378dd734613b238f67fd24bd10bb1dc66667f5003c730c58df0e900de9"},"schema_version":"1.0","source":{"id":"1812.11564","kind":"arxiv","version":1}},"canonical_sha256":"8f110500ce9003c858e6edd368e06d665febc6ad5a8a99ce0f3042f74a7098c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f110500ce9003c858e6edd368e06d665febc6ad5a8a99ce0f3042f74a7098c9","first_computed_at":"2026-05-17T23:57:11.639987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:11.639987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U5YLkze9VwwUBZvLAHrtyLheUxo3nnVosdCeIVp5xLoBo3XCbAjb3V1FoZN0zfeiOj85AP5F+AUBHi/v33SzDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:11.640548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.11564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29643c69efe955e87fb7ec29c5b64813c3d018602b7a7d592b1e709e9df09587","sha256:cf0d5a795d34a0c705fc616cb7a41a8700426e68ead70cad101cb57dd1a90f58"],"state_sha256":"8a7ebe692d8ae604946085dab5d4e9c12a2cffdae1f0d5abc8408f8e935e2262"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WcoomXm+HzrLH9JmAUFiHsYpX3E/OZJIdihrWXPm2dngBk6+gasVZvoEMAln5uoQenn6mjkS403Gi1cXumodBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:51:12.054683Z","bundle_sha256":"5ec55193e8a27d04705baa210f328b9225d62c6629575eb40caa77db079f35ef"}}