{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MWENMJ2PFPHY44PLGGOF7XBG4R","short_pith_number":"pith:MWENMJ2P","canonical_record":{"source":{"id":"1204.1616","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-07T09:54:25Z","cross_cats_sorted":[],"title_canon_sha256":"236987ebff6eb98de3c987aa3e32e9dc331365116e1c4b7e3a3578c92e1e5bc1","abstract_canon_sha256":"79a727343cc574caa4974b356dfc8ea43c1ac831d67b45514debb9ea4bcf25bf"},"schema_version":"1.0"},"canonical_sha256":"6588d6274f2bcf8e71eb319c5fdc26e4443728f328ad4ab98122d1270f8dec9e","source":{"kind":"arxiv","id":"1204.1616","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1616","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1616v2","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1616","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"MWENMJ2PFPHY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MWENMJ2PFPHY44PL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MWENMJ2P","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MWENMJ2PFPHY44PLGGOF7XBG4R","target":"record","payload":{"canonical_record":{"source":{"id":"1204.1616","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-07T09:54:25Z","cross_cats_sorted":[],"title_canon_sha256":"236987ebff6eb98de3c987aa3e32e9dc331365116e1c4b7e3a3578c92e1e5bc1","abstract_canon_sha256":"79a727343cc574caa4974b356dfc8ea43c1ac831d67b45514debb9ea4bcf25bf"},"schema_version":"1.0"},"canonical_sha256":"6588d6274f2bcf8e71eb319c5fdc26e4443728f328ad4ab98122d1270f8dec9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:35.382231Z","signature_b64":"XrRpJgegFw6DlaZQHJo1LuZ+2XrZuoy9q5gKEt+2C9N32qRuCGxPbbziWm+dyXqMmF6Vy9U1VsXeYGJEzlM4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6588d6274f2bcf8e71eb319c5fdc26e4443728f328ad4ab98122d1270f8dec9e","last_reissued_at":"2026-05-18T03:48:35.381725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:35.381725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.1616","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-18T03:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qeSOqWCgzLUXwoQVUaQaG4+kdI0EF1aZMWv0yjnhAu07JsdNP2M8fTCTwJTePkh1oWWblDlhWDIZHTje/8fjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:50:46.507442Z"},"content_sha256":"b71acf7feda6ec95812b39f8804ded597c12c0c226f59ffcd981bd12bfdad1bd","schema_version":"1.0","event_id":"sha256:b71acf7feda6ec95812b39f8804ded597c12c0c226f59ffcd981bd12bfdad1bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MWENMJ2PFPHY44PLGGOF7XBG4R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Harold N. Gabow, Marek Cygan, Piotr Sankowski","submitted_at":"2012-04-07T09:54:25Z","abstract_excerpt":"Consider a directed or an undirected graph with integral edge weights from the set [-W, W], that does not contain negative weight cycles. In this paper, we introduce a general framework for solving problems on such graphs using matrix multiplication. The framework is based on the usage of Baur-Strassen's theorem and of Strojohann's determinant algorithm. It allows us to give new and simple solutions to the following problems:\n  * Finding Shortest Cycles -- We give a simple \\tilde{O}(Wn^{\\omega}) time algorithm for finding shortest cycles in undirected and directed graphs. For directed graphs ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1616","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-18T03:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gy7UMW+f+vMy9IyAemeWZS04cWJm3oo7cZjzMaesQJkhQbgh6UK7rElaB/Z2pBQCci53vMsbUIi0vevLM6HNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:50:46.508006Z"},"content_sha256":"201d2071aa48765f5d0bf954d3e13ee9ceb36034c08741e15b02c15ee026011a","schema_version":"1.0","event_id":"sha256:201d2071aa48765f5d0bf954d3e13ee9ceb36034c08741e15b02c15ee026011a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWENMJ2PFPHY44PLGGOF7XBG4R/bundle.json","state_url":"https://pith.science/pith/MWENMJ2PFPHY44PLGGOF7XBG4R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWENMJ2PFPHY44PLGGOF7XBG4R/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-18T22:50:46Z","links":{"resolver":"https://pith.science/pith/MWENMJ2PFPHY44PLGGOF7XBG4R","bundle":"https://pith.science/pith/MWENMJ2PFPHY44PLGGOF7XBG4R/bundle.json","state":"https://pith.science/pith/MWENMJ2PFPHY44PLGGOF7XBG4R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWENMJ2PFPHY44PLGGOF7XBG4R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MWENMJ2PFPHY44PLGGOF7XBG4R","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":"79a727343cc574caa4974b356dfc8ea43c1ac831d67b45514debb9ea4bcf25bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-07T09:54:25Z","title_canon_sha256":"236987ebff6eb98de3c987aa3e32e9dc331365116e1c4b7e3a3578c92e1e5bc1"},"schema_version":"1.0","source":{"id":"1204.1616","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1616","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1616v2","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1616","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"MWENMJ2PFPHY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MWENMJ2PFPHY44PL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MWENMJ2P","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:201d2071aa48765f5d0bf954d3e13ee9ceb36034c08741e15b02c15ee026011a","target":"graph","created_at":"2026-05-18T03:48:35Z","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":"Consider a directed or an undirected graph with integral edge weights from the set [-W, W], that does not contain negative weight cycles. In this paper, we introduce a general framework for solving problems on such graphs using matrix multiplication. The framework is based on the usage of Baur-Strassen's theorem and of Strojohann's determinant algorithm. It allows us to give new and simple solutions to the following problems:\n  * Finding Shortest Cycles -- We give a simple \\tilde{O}(Wn^{\\omega}) time algorithm for finding shortest cycles in undirected and directed graphs. For directed graphs (","authors_text":"Harold N. Gabow, Marek Cygan, Piotr Sankowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-07T09:54:25Z","title":"Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1616","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:b71acf7feda6ec95812b39f8804ded597c12c0c226f59ffcd981bd12bfdad1bd","target":"record","created_at":"2026-05-18T03:48:35Z","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":"79a727343cc574caa4974b356dfc8ea43c1ac831d67b45514debb9ea4bcf25bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-07T09:54:25Z","title_canon_sha256":"236987ebff6eb98de3c987aa3e32e9dc331365116e1c4b7e3a3578c92e1e5bc1"},"schema_version":"1.0","source":{"id":"1204.1616","kind":"arxiv","version":2}},"canonical_sha256":"6588d6274f2bcf8e71eb319c5fdc26e4443728f328ad4ab98122d1270f8dec9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6588d6274f2bcf8e71eb319c5fdc26e4443728f328ad4ab98122d1270f8dec9e","first_computed_at":"2026-05-18T03:48:35.381725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:35.381725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XrRpJgegFw6DlaZQHJo1LuZ+2XrZuoy9q5gKEt+2C9N32qRuCGxPbbziWm+dyXqMmF6Vy9U1VsXeYGJEzlM4AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:35.382231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1616","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b71acf7feda6ec95812b39f8804ded597c12c0c226f59ffcd981bd12bfdad1bd","sha256:201d2071aa48765f5d0bf954d3e13ee9ceb36034c08741e15b02c15ee026011a"],"state_sha256":"068c657f080653c49599a2b2fb52b0d0528fcd69af2395470015a92cdbb4b705"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7RiUKi3tf3bRGtz5xKy1D+Sw25Guz+dGozerbsJR5zNWv13vWVxJ7QMFLE2HsU897III3iLGL8QyRHemY47CDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T22:50:46.509825Z","bundle_sha256":"e518cc1f598d8c72fe4d3fdcf2815278879b6603a8a26b86a079a8c0e1645739"}}