{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BWXUSHIN2CD4ZZDVEKUXMLUF3O","short_pith_number":"pith:BWXUSHIN","canonical_record":{"source":{"id":"1104.2882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-14T19:32:10Z","cross_cats_sorted":[],"title_canon_sha256":"3e5e7f21bd9670167111a0288b241b1e945da7d73627d0203dee34c86f4f0888","abstract_canon_sha256":"be524e2bf1a5c43db64d1655da99621ca128ea2e7359c1425928d416e93ad54f"},"schema_version":"1.0"},"canonical_sha256":"0daf491d0dd087cce47522a9762e85db83918042d7f672114bbc60adebe1ca8c","source":{"kind":"arxiv","id":"1104.2882","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2882","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2882v1","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2882","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"BWXUSHIN2CD4","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BWXUSHIN2CD4ZZDV","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BWXUSHIN","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BWXUSHIN2CD4ZZDVEKUXMLUF3O","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-14T19:32:10Z","cross_cats_sorted":[],"title_canon_sha256":"3e5e7f21bd9670167111a0288b241b1e945da7d73627d0203dee34c86f4f0888","abstract_canon_sha256":"be524e2bf1a5c43db64d1655da99621ca128ea2e7359c1425928d416e93ad54f"},"schema_version":"1.0"},"canonical_sha256":"0daf491d0dd087cce47522a9762e85db83918042d7f672114bbc60adebe1ca8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:26.669577Z","signature_b64":"rDxT3eBl7fNuhgBBRGOtZIuqw0afuOXSmHS7Dn6r2a8aN1z7XokMc+nB4BhheEIYVg7T5QFIAS/6i41matBSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0daf491d0dd087cce47522a9762e85db83918042d7f672114bbc60adebe1ca8c","last_reissued_at":"2026-05-18T04:24:26.668971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:26.668971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2882","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-18T04:24:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jCMnaBw1wwefbR5tnSBGJhcCV8rpid/u1ybP7LF4Kzx22o5g84cxlI3s8aCNodDPBhWT5w8ncH+s8eQPns7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:43:17.839299Z"},"content_sha256":"5a2b75aed55c3db4a9abf215e35436d410d25f7bd9077d8d3bc02b9fcd99d820","schema_version":"1.0","event_id":"sha256:5a2b75aed55c3db4a9abf215e35436d410d25f7bd9077d8d3bc02b9fcd99d820"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BWXUSHIN2CD4ZZDVEKUXMLUF3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Weight Cycles and Triangles: Equivalences and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Liam Roditty, Virginia Vassilevska Williams","submitted_at":"2011-04-14T19:32:10Z","abstract_excerpt":"We consider the fundamental algorithmic problem of finding a cycle of minimum weight in a weighted graph. In particular, we show that the minimum weight cycle problem in an undirected n-node graph with edge weights in {1,...,M} or in a directed n-node graph with edge weights in {-M,..., M} and no negative cycles can be efficiently reduced to finding a minimum weight triangle in an Theta(n)-node undirected graph with weights in {1,...,O(M)}. Roughly speaking, our reductions imply the following surprising phenomenon: a minimum cycle with an arbitrary number of weighted edges can be \"encoded\" usi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2882","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-18T04:24:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCRTGaAYsPyvuVUvX893n+LiZ3blGw88eIUtD1niGdybcNaQ+Qu/Of4FifxNZiJjM4QKz8FR1RL8QQjGxy7gDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:43:17.839968Z"},"content_sha256":"1da6725e6080af33abfed3334836ac26c2c4b2931de1c65d8704767d3edf5245","schema_version":"1.0","event_id":"sha256:1da6725e6080af33abfed3334836ac26c2c4b2931de1c65d8704767d3edf5245"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWXUSHIN2CD4ZZDVEKUXMLUF3O/bundle.json","state_url":"https://pith.science/pith/BWXUSHIN2CD4ZZDVEKUXMLUF3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWXUSHIN2CD4ZZDVEKUXMLUF3O/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-11T19:43:17Z","links":{"resolver":"https://pith.science/pith/BWXUSHIN2CD4ZZDVEKUXMLUF3O","bundle":"https://pith.science/pith/BWXUSHIN2CD4ZZDVEKUXMLUF3O/bundle.json","state":"https://pith.science/pith/BWXUSHIN2CD4ZZDVEKUXMLUF3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWXUSHIN2CD4ZZDVEKUXMLUF3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BWXUSHIN2CD4ZZDVEKUXMLUF3O","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":"be524e2bf1a5c43db64d1655da99621ca128ea2e7359c1425928d416e93ad54f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-14T19:32:10Z","title_canon_sha256":"3e5e7f21bd9670167111a0288b241b1e945da7d73627d0203dee34c86f4f0888"},"schema_version":"1.0","source":{"id":"1104.2882","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2882","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2882v1","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2882","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"BWXUSHIN2CD4","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BWXUSHIN2CD4ZZDV","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BWXUSHIN","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:1da6725e6080af33abfed3334836ac26c2c4b2931de1c65d8704767d3edf5245","target":"graph","created_at":"2026-05-18T04:24:26Z","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 consider the fundamental algorithmic problem of finding a cycle of minimum weight in a weighted graph. In particular, we show that the minimum weight cycle problem in an undirected n-node graph with edge weights in {1,...,M} or in a directed n-node graph with edge weights in {-M,..., M} and no negative cycles can be efficiently reduced to finding a minimum weight triangle in an Theta(n)-node undirected graph with weights in {1,...,O(M)}. Roughly speaking, our reductions imply the following surprising phenomenon: a minimum cycle with an arbitrary number of weighted edges can be \"encoded\" usi","authors_text":"Liam Roditty, Virginia Vassilevska Williams","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-14T19:32:10Z","title":"Minimum Weight Cycles and Triangles: Equivalences and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2882","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:5a2b75aed55c3db4a9abf215e35436d410d25f7bd9077d8d3bc02b9fcd99d820","target":"record","created_at":"2026-05-18T04:24:26Z","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":"be524e2bf1a5c43db64d1655da99621ca128ea2e7359c1425928d416e93ad54f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-14T19:32:10Z","title_canon_sha256":"3e5e7f21bd9670167111a0288b241b1e945da7d73627d0203dee34c86f4f0888"},"schema_version":"1.0","source":{"id":"1104.2882","kind":"arxiv","version":1}},"canonical_sha256":"0daf491d0dd087cce47522a9762e85db83918042d7f672114bbc60adebe1ca8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0daf491d0dd087cce47522a9762e85db83918042d7f672114bbc60adebe1ca8c","first_computed_at":"2026-05-18T04:24:26.668971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:26.668971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rDxT3eBl7fNuhgBBRGOtZIuqw0afuOXSmHS7Dn6r2a8aN1z7XokMc+nB4BhheEIYVg7T5QFIAS/6i41matBSCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:26.669577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2882","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a2b75aed55c3db4a9abf215e35436d410d25f7bd9077d8d3bc02b9fcd99d820","sha256:1da6725e6080af33abfed3334836ac26c2c4b2931de1c65d8704767d3edf5245"],"state_sha256":"ed72a0946c1413ca407f71726d6ff9a13520e670cb313be305279d5ca4639224"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEeJj+M3q7D2YjlOXQpsGLIvRv5rFxyd/EwBc8bJXcwVwFKAmu//N9+fRWDeMaBvHNGrZNiJlHpxbwahVOG0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:43:17.842943Z","bundle_sha256":"fe6767b9e0b435f4e57b9561e9987651ffe445de727a338b7fd1c9bf128243bb"}}