{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NLLNQF4F33AQAKD43FA4JSBJKN","short_pith_number":"pith:NLLNQF4F","canonical_record":{"source":{"id":"1410.3889","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-14T23:05:57Z","cross_cats_sorted":[],"title_canon_sha256":"70dad0857a6e1ecb1485ba50f1fe80eaa5d9a42c9f9f6f98259fb02ec911bb77","abstract_canon_sha256":"4226e9313cce1a64aacc8e325b1ee29286d8481d515b1c63aa933a9c8b57bdc4"},"schema_version":"1.0"},"canonical_sha256":"6ad6d81785dec100287cd941c4c82953682e2dac1eed3bfac70bbbabb46618e9","source":{"kind":"arxiv","id":"1410.3889","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3889","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3889v2","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3889","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"NLLNQF4F33AQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NLLNQF4F33AQAKD4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NLLNQF4F","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NLLNQF4F33AQAKD43FA4JSBJKN","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3889","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-14T23:05:57Z","cross_cats_sorted":[],"title_canon_sha256":"70dad0857a6e1ecb1485ba50f1fe80eaa5d9a42c9f9f6f98259fb02ec911bb77","abstract_canon_sha256":"4226e9313cce1a64aacc8e325b1ee29286d8481d515b1c63aa933a9c8b57bdc4"},"schema_version":"1.0"},"canonical_sha256":"6ad6d81785dec100287cd941c4c82953682e2dac1eed3bfac70bbbabb46618e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:01.387121Z","signature_b64":"sQljJIP32l1IzPqrhwpuPBPtBw6m8CBxBMgceHFuFM+MO8yoJacrkLl6UoA+B9Dx/BpgYHaGfPutZYLiu5UhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ad6d81785dec100287cd941c4c82953682e2dac1eed3bfac70bbbabb46618e9","last_reissued_at":"2026-05-18T01:04:01.386427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:01.386427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3889","source_version":2,"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:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFzySD9cMbewY1Q9YG5xu4ip58BUKDtVcteUMLSvcH4aUzIOvXZzCpXdTZksv+u6JhwKbOq8HepiPzvv6qRbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:00:11.490742Z"},"content_sha256":"1b36d482e9b071293586aba7d912ef42ad49d67bef9770c88474ffdb43ac35e4","schema_version":"1.0","event_id":"sha256:1b36d482e9b071293586aba7d912ef42ad49d67bef9770c88474ffdb43ac35e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NLLNQF4F33AQAKD43FA4JSBJKN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cheeger-type approximation for sparsest $st$-cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Robert Krauthgamer, Tal Wagner","submitted_at":"2014-10-14T23:05:57Z","abstract_excerpt":"We introduce the $st$-cut version the Sparsest-Cut problem, where the goal is to find a cut of minimum sparsity among those separating two distinguished vertices $s,t\\in V$. Clearly, this problem is at least as hard as the usual (non-$st$) version. Our main result is a polynomial-time algorithm for the product-demands setting, that produces a cut of sparsity $O(\\sqrt{\\OPT})$, where $\\OPT$ denotes the optimum, and the total edge capacity and the total demand are assumed (by normalization) to be $1$.\n  Our result generalizes the recent work of Trevisan [arXiv, 2013] for the non-$st$ version of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3889","kind":"arxiv","version":2},"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:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Syh6JDPVViPV3620sry+cyrv36WRGG6ad4VRxzju3DyVPYQkimAWn/NWb1h9OXMBXVCgIjzzmzvozuvmi1uPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:00:11.491085Z"},"content_sha256":"312bbd6f78fdd0a2b6b43df817e23d6f7ae4d410b1a971ef706c9e048ccb42a4","schema_version":"1.0","event_id":"sha256:312bbd6f78fdd0a2b6b43df817e23d6f7ae4d410b1a971ef706c9e048ccb42a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLLNQF4F33AQAKD43FA4JSBJKN/bundle.json","state_url":"https://pith.science/pith/NLLNQF4F33AQAKD43FA4JSBJKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLLNQF4F33AQAKD43FA4JSBJKN/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-02T21:00:11Z","links":{"resolver":"https://pith.science/pith/NLLNQF4F33AQAKD43FA4JSBJKN","bundle":"https://pith.science/pith/NLLNQF4F33AQAKD43FA4JSBJKN/bundle.json","state":"https://pith.science/pith/NLLNQF4F33AQAKD43FA4JSBJKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLLNQF4F33AQAKD43FA4JSBJKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NLLNQF4F33AQAKD43FA4JSBJKN","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":"4226e9313cce1a64aacc8e325b1ee29286d8481d515b1c63aa933a9c8b57bdc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-14T23:05:57Z","title_canon_sha256":"70dad0857a6e1ecb1485ba50f1fe80eaa5d9a42c9f9f6f98259fb02ec911bb77"},"schema_version":"1.0","source":{"id":"1410.3889","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3889","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3889v2","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3889","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"NLLNQF4F33AQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NLLNQF4F33AQAKD4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NLLNQF4F","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:312bbd6f78fdd0a2b6b43df817e23d6f7ae4d410b1a971ef706c9e048ccb42a4","target":"graph","created_at":"2026-05-18T01:04:01Z","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 introduce the $st$-cut version the Sparsest-Cut problem, where the goal is to find a cut of minimum sparsity among those separating two distinguished vertices $s,t\\in V$. Clearly, this problem is at least as hard as the usual (non-$st$) version. Our main result is a polynomial-time algorithm for the product-demands setting, that produces a cut of sparsity $O(\\sqrt{\\OPT})$, where $\\OPT$ denotes the optimum, and the total edge capacity and the total demand are assumed (by normalization) to be $1$.\n  Our result generalizes the recent work of Trevisan [arXiv, 2013] for the non-$st$ version of t","authors_text":"Robert Krauthgamer, Tal Wagner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-14T23:05:57Z","title":"Cheeger-type approximation for sparsest $st$-cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3889","kind":"arxiv","version":2},"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:1b36d482e9b071293586aba7d912ef42ad49d67bef9770c88474ffdb43ac35e4","target":"record","created_at":"2026-05-18T01:04:01Z","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":"4226e9313cce1a64aacc8e325b1ee29286d8481d515b1c63aa933a9c8b57bdc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-14T23:05:57Z","title_canon_sha256":"70dad0857a6e1ecb1485ba50f1fe80eaa5d9a42c9f9f6f98259fb02ec911bb77"},"schema_version":"1.0","source":{"id":"1410.3889","kind":"arxiv","version":2}},"canonical_sha256":"6ad6d81785dec100287cd941c4c82953682e2dac1eed3bfac70bbbabb46618e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ad6d81785dec100287cd941c4c82953682e2dac1eed3bfac70bbbabb46618e9","first_computed_at":"2026-05-18T01:04:01.386427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:01.386427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sQljJIP32l1IzPqrhwpuPBPtBw6m8CBxBMgceHFuFM+MO8yoJacrkLl6UoA+B9Dx/BpgYHaGfPutZYLiu5UhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:01.387121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3889","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b36d482e9b071293586aba7d912ef42ad49d67bef9770c88474ffdb43ac35e4","sha256:312bbd6f78fdd0a2b6b43df817e23d6f7ae4d410b1a971ef706c9e048ccb42a4"],"state_sha256":"5a1817fb0e4d4c6d866ac7f2b9eed22a40020df1e0b81e8f6c6dc6117284fb7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iivTzk/JPdVP5dV+S+ZkB4o2uF5SGg+eyd1JOusv1w6Gj9I8ieYUNPgKHLS9y8mql53gn5Aih7mFycCAjosCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:00:11.493090Z","bundle_sha256":"07a27326ee81f97eb9cdd46c9f8c29c572af3d4bcf806ca190b5da074eafb142"}}