{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:L7EQZYVLPGQMN3QTWK6GGSEXE5","short_pith_number":"pith:L7EQZYVL","canonical_record":{"source":{"id":"1705.02390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T20:36:51Z","cross_cats_sorted":[],"title_canon_sha256":"0921b3e7581be702edd8aebbb3ebfe6b004563712469b260f20347ed910ace1b","abstract_canon_sha256":"1085b772dc2e1a107d4feac76d3b1ae6608e59aec0a0196ba44a3c73ef23e38c"},"schema_version":"1.0"},"canonical_sha256":"5fc90ce2ab79a0c6ee13b2bc6348972764e5e0b3949fefbe5935747afbd9d70c","source":{"kind":"arxiv","id":"1705.02390","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02390","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02390v2","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02390","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"L7EQZYVLPGQM","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L7EQZYVLPGQMN3QT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L7EQZYVL","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:L7EQZYVLPGQMN3QTWK6GGSEXE5","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T20:36:51Z","cross_cats_sorted":[],"title_canon_sha256":"0921b3e7581be702edd8aebbb3ebfe6b004563712469b260f20347ed910ace1b","abstract_canon_sha256":"1085b772dc2e1a107d4feac76d3b1ae6608e59aec0a0196ba44a3c73ef23e38c"},"schema_version":"1.0"},"canonical_sha256":"5fc90ce2ab79a0c6ee13b2bc6348972764e5e0b3949fefbe5935747afbd9d70c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:46.296560Z","signature_b64":"GpO9DusJyG+PTPDO6618YmJuq2uoVAJJlvPLN8VrZM/gLVt4JJNGklG6Deb+bw+ClBY/rA/NTIAOFgL34fueDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fc90ce2ab79a0c6ee13b2bc6348972764e5e0b3949fefbe5935747afbd9d70c","last_reissued_at":"2026-05-18T00:35:46.296046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:46.296046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02390","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-18T00:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12HikwlOWjDPICzgBEqfYGHi7lfdVeXXWce3mQ0uZLYtsfKiPPHY9RnBvz+KE6MO3fkhkPmavXE2qpgmIxZVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:33:06.421209Z"},"content_sha256":"f11782cd0b14d80bc7f6bd2dcc511cfa7026687285018c7edd9ebc2a63acb466","schema_version":"1.0","event_id":"sha256:f11782cd0b14d80bc7f6bd2dcc511cfa7026687285018c7edd9ebc2a63acb466"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:L7EQZYVLPGQMN3QTWK6GGSEXE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Algorithms for $L$-bounded Cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Petr Kolman","submitted_at":"2017-05-05T20:36:51Z","abstract_excerpt":"Given a graph $G=(V,E)$ with two distinguished vertices $s,t\\in V$ and an integer parameter $L>0$, an {\\em $L$-bounded cut} is a subset $F$ of edges (vertices) such that the every path between $s$ and $t$ in $G\\setminus F$ has length more than $L$. The task is to find an $L$-bounded cut of minimum cardinality.\n  Though the problem is very simple to state and has been studied since the beginning of the 70's, it is not much understood yet. The problem is known to be $\\cal{NP}$-hard to approximate within a small constant factor even for $L\\geq 4$ (for $L\\geq 5$ for the vertex cuts). On the other "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02390","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-18T00:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZqPh0zMqs3NXthMB9f+/n+laZaWsWY6Bq6fvm+I4o/gRFZ2nYyBtLXIq9/MVj/2GLOAhSmMgV+lyfXNHXT9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:33:06.421887Z"},"content_sha256":"3e72aa809aa9796886a42d95491ab91604ef4213406ec8ea970d2280a26d7afe","schema_version":"1.0","event_id":"sha256:3e72aa809aa9796886a42d95491ab91604ef4213406ec8ea970d2280a26d7afe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7EQZYVLPGQMN3QTWK6GGSEXE5/bundle.json","state_url":"https://pith.science/pith/L7EQZYVLPGQMN3QTWK6GGSEXE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7EQZYVLPGQMN3QTWK6GGSEXE5/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-08T21:33:06Z","links":{"resolver":"https://pith.science/pith/L7EQZYVLPGQMN3QTWK6GGSEXE5","bundle":"https://pith.science/pith/L7EQZYVLPGQMN3QTWK6GGSEXE5/bundle.json","state":"https://pith.science/pith/L7EQZYVLPGQMN3QTWK6GGSEXE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7EQZYVLPGQMN3QTWK6GGSEXE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L7EQZYVLPGQMN3QTWK6GGSEXE5","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":"1085b772dc2e1a107d4feac76d3b1ae6608e59aec0a0196ba44a3c73ef23e38c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T20:36:51Z","title_canon_sha256":"0921b3e7581be702edd8aebbb3ebfe6b004563712469b260f20347ed910ace1b"},"schema_version":"1.0","source":{"id":"1705.02390","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02390","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02390v2","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02390","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"L7EQZYVLPGQM","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L7EQZYVLPGQMN3QT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L7EQZYVL","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:3e72aa809aa9796886a42d95491ab91604ef4213406ec8ea970d2280a26d7afe","target":"graph","created_at":"2026-05-18T00:35:46Z","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":"Given a graph $G=(V,E)$ with two distinguished vertices $s,t\\in V$ and an integer parameter $L>0$, an {\\em $L$-bounded cut} is a subset $F$ of edges (vertices) such that the every path between $s$ and $t$ in $G\\setminus F$ has length more than $L$. The task is to find an $L$-bounded cut of minimum cardinality.\n  Though the problem is very simple to state and has been studied since the beginning of the 70's, it is not much understood yet. The problem is known to be $\\cal{NP}$-hard to approximate within a small constant factor even for $L\\geq 4$ (for $L\\geq 5$ for the vertex cuts). On the other ","authors_text":"Petr Kolman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T20:36:51Z","title":"On Algorithms for $L$-bounded Cut Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02390","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:f11782cd0b14d80bc7f6bd2dcc511cfa7026687285018c7edd9ebc2a63acb466","target":"record","created_at":"2026-05-18T00:35:46Z","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":"1085b772dc2e1a107d4feac76d3b1ae6608e59aec0a0196ba44a3c73ef23e38c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T20:36:51Z","title_canon_sha256":"0921b3e7581be702edd8aebbb3ebfe6b004563712469b260f20347ed910ace1b"},"schema_version":"1.0","source":{"id":"1705.02390","kind":"arxiv","version":2}},"canonical_sha256":"5fc90ce2ab79a0c6ee13b2bc6348972764e5e0b3949fefbe5935747afbd9d70c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fc90ce2ab79a0c6ee13b2bc6348972764e5e0b3949fefbe5935747afbd9d70c","first_computed_at":"2026-05-18T00:35:46.296046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:46.296046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GpO9DusJyG+PTPDO6618YmJuq2uoVAJJlvPLN8VrZM/gLVt4JJNGklG6Deb+bw+ClBY/rA/NTIAOFgL34fueDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:46.296560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02390","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f11782cd0b14d80bc7f6bd2dcc511cfa7026687285018c7edd9ebc2a63acb466","sha256:3e72aa809aa9796886a42d95491ab91604ef4213406ec8ea970d2280a26d7afe"],"state_sha256":"2fd5fbab18bb160ce17f2d517e66737e1efaf2d559b9629f8080b48338340dc4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+nCtn5EtXaV/ehBS8ltIaEU+RkJ5dL1QBHH8ayIFRi4s6Z5/fUz77M9H3imzzJmjdGWq3BuFEyExYmcG4lEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:33:06.425619Z","bundle_sha256":"f2da37ab27237dd8ee1859f4ceadbc5ec9c63d7cd5ec7a567ee6dd95c6a7c7bb"}}