{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OTEC5M6WN7DRX3HQ6LRMLXJQPB","short_pith_number":"pith:OTEC5M6W","canonical_record":{"source":{"id":"1204.4666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-20T16:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"9359c9ae8445cb1f4b71cb664d1298c09bfa0982b8e6bbcba655b2fc51f3875a","abstract_canon_sha256":"f3e4909b14f7da30d48dc469de7af530cab6a2611c899ffcc40f21cdfd3e024a"},"schema_version":"1.0"},"canonical_sha256":"74c82eb3d66fc71becf0f2e2c5dd3078660791d1d9d4535ef5295560b222f6a6","source":{"kind":"arxiv","id":"1204.4666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4666","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4666v1","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4666","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"OTEC5M6WN7DR","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OTEC5M6WN7DRX3HQ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OTEC5M6W","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OTEC5M6WN7DRX3HQ6LRMLXJQPB","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-20T16:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"9359c9ae8445cb1f4b71cb664d1298c09bfa0982b8e6bbcba655b2fc51f3875a","abstract_canon_sha256":"f3e4909b14f7da30d48dc469de7af530cab6a2611c899ffcc40f21cdfd3e024a"},"schema_version":"1.0"},"canonical_sha256":"74c82eb3d66fc71becf0f2e2c5dd3078660791d1d9d4535ef5295560b222f6a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:25.766214Z","signature_b64":"yQMo0sHWwzo3TLfHXvyPdOFZFm/DXhHAaVNkR3qCQz2195MzELEfKIE3NUtpO9oRj00ylJzQp9O/dx4dqxotDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74c82eb3d66fc71becf0f2e2c5dd3078660791d1d9d4535ef5295560b222f6a6","last_reissued_at":"2026-05-18T03:57:25.765466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:25.765466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4666","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-18T03:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XeKYmUutvy3ns1XqAqrdVKgWB73b1rdtrfiXuIi47nrG5OsOeZb5lisCY6EP+9N4vrZxYjfGyz7iuUVYxfxmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:11:43.100884Z"},"content_sha256":"95206148ced42e8db107249f6a24a0789a90889775edc2e1cb39c40fe9b0f4d2","schema_version":"1.0","event_id":"sha256:95206148ced42e8db107249f6a24a0789a90889775edc2e1cb39c40fe9b0f4d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OTEC5M6WN7DRX3HQ6LRMLXJQPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Small Sparse Cuts Locally by Random Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lap Chi Lau, Tsz Chiu Kwok","submitted_at":"2012-04-20T16:16:01Z","abstract_excerpt":"We study the problem of finding a small sparse cut in an undirected graph. Given an undirected graph G=(V,E) and a parameter k <= |E|, the small sparsest cut problem is to find a subset of vertices S with minimum conductance among all sets with volume at most k. Using ideas developed in local graph partitioning algorithms, we obtain the following bicriteria approximation algorithms for the small sparsest cut problem:\n  - If there is a subset U with conductance \\phi and vol(U) <= k, then there is a polynomial time algorithm to find a set S with conductance O(\\sqrt{\\phi/\\epsilon}) and vol(S) <= "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4666","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-18T03:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+YkFp98Oy+JrwxUrS9nTsKyDjRR2sV4Y5XDgaVe3ZMTN6HkP29TygCuSVb09TGGEB5dj4dXyWRGHvHYFT78DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:11:43.101534Z"},"content_sha256":"8b7782d80c542df99622a6f9b264b7caaf7a603f62ea8b454186d5edbffa5dd2","schema_version":"1.0","event_id":"sha256:8b7782d80c542df99622a6f9b264b7caaf7a603f62ea8b454186d5edbffa5dd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTEC5M6WN7DRX3HQ6LRMLXJQPB/bundle.json","state_url":"https://pith.science/pith/OTEC5M6WN7DRX3HQ6LRMLXJQPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTEC5M6WN7DRX3HQ6LRMLXJQPB/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-27T20:11:43Z","links":{"resolver":"https://pith.science/pith/OTEC5M6WN7DRX3HQ6LRMLXJQPB","bundle":"https://pith.science/pith/OTEC5M6WN7DRX3HQ6LRMLXJQPB/bundle.json","state":"https://pith.science/pith/OTEC5M6WN7DRX3HQ6LRMLXJQPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTEC5M6WN7DRX3HQ6LRMLXJQPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OTEC5M6WN7DRX3HQ6LRMLXJQPB","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":"f3e4909b14f7da30d48dc469de7af530cab6a2611c899ffcc40f21cdfd3e024a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-20T16:16:01Z","title_canon_sha256":"9359c9ae8445cb1f4b71cb664d1298c09bfa0982b8e6bbcba655b2fc51f3875a"},"schema_version":"1.0","source":{"id":"1204.4666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4666","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4666v1","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4666","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"OTEC5M6WN7DR","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OTEC5M6WN7DRX3HQ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OTEC5M6W","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:8b7782d80c542df99622a6f9b264b7caaf7a603f62ea8b454186d5edbffa5dd2","target":"graph","created_at":"2026-05-18T03:57:25Z","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":"We study the problem of finding a small sparse cut in an undirected graph. Given an undirected graph G=(V,E) and a parameter k <= |E|, the small sparsest cut problem is to find a subset of vertices S with minimum conductance among all sets with volume at most k. Using ideas developed in local graph partitioning algorithms, we obtain the following bicriteria approximation algorithms for the small sparsest cut problem:\n  - If there is a subset U with conductance \\phi and vol(U) <= k, then there is a polynomial time algorithm to find a set S with conductance O(\\sqrt{\\phi/\\epsilon}) and vol(S) <= ","authors_text":"Lap Chi Lau, Tsz Chiu Kwok","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-20T16:16:01Z","title":"Finding Small Sparse Cuts Locally by Random Walk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4666","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:95206148ced42e8db107249f6a24a0789a90889775edc2e1cb39c40fe9b0f4d2","target":"record","created_at":"2026-05-18T03:57:25Z","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":"f3e4909b14f7da30d48dc469de7af530cab6a2611c899ffcc40f21cdfd3e024a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-20T16:16:01Z","title_canon_sha256":"9359c9ae8445cb1f4b71cb664d1298c09bfa0982b8e6bbcba655b2fc51f3875a"},"schema_version":"1.0","source":{"id":"1204.4666","kind":"arxiv","version":1}},"canonical_sha256":"74c82eb3d66fc71becf0f2e2c5dd3078660791d1d9d4535ef5295560b222f6a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74c82eb3d66fc71becf0f2e2c5dd3078660791d1d9d4535ef5295560b222f6a6","first_computed_at":"2026-05-18T03:57:25.765466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:25.765466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yQMo0sHWwzo3TLfHXvyPdOFZFm/DXhHAaVNkR3qCQz2195MzELEfKIE3NUtpO9oRj00ylJzQp9O/dx4dqxotDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:25.766214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95206148ced42e8db107249f6a24a0789a90889775edc2e1cb39c40fe9b0f4d2","sha256:8b7782d80c542df99622a6f9b264b7caaf7a603f62ea8b454186d5edbffa5dd2"],"state_sha256":"59e390861513cbc45195c9526090a497498072148bc5ca0e8ae02340586a9b62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6aUOsGjK5Ygvy8P3JEL4MjC2cORb2QddFa5DJNOThCicHGps8Uzj0fKiIdQ53dR/z1fS+s+aszQV+NSzAtYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:11:43.104866Z","bundle_sha256":"3566ab23b1f0970d645e3a1819720dfbf5443f04840de9e60244ba54be3d4111"}}