{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5BOHW7Y6LACVSIFQHATC7CD5BL","short_pith_number":"pith:5BOHW7Y6","canonical_record":{"source":{"id":"1611.07008","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T20:53:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"be461670f179118f7ef173641721e1ee46f76002db52f03a51749a7850287bd3","abstract_canon_sha256":"43d862e1f5f3330a434790369f1214c426f404040630311f7be993801effb28a"},"schema_version":"1.0"},"canonical_sha256":"e85c7b7f1e58055920b038262f887d0ad11d4f5cd7a967f81c6f45b9716017a1","source":{"kind":"arxiv","id":"1611.07008","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07008","created_at":"2026-05-18T00:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07008v3","created_at":"2026-05-18T00:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07008","created_at":"2026-05-18T00:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"5BOHW7Y6LACV","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5BOHW7Y6LACVSIFQ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5BOHW7Y6","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5BOHW7Y6LACVSIFQHATC7CD5BL","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07008","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T20:53:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"be461670f179118f7ef173641721e1ee46f76002db52f03a51749a7850287bd3","abstract_canon_sha256":"43d862e1f5f3330a434790369f1214c426f404040630311f7be993801effb28a"},"schema_version":"1.0"},"canonical_sha256":"e85c7b7f1e58055920b038262f887d0ad11d4f5cd7a967f81c6f45b9716017a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:31.220571Z","signature_b64":"PbFZE4o0z0kzuzurg38buBesAjCyMij9PT7OpmTofdJyfLa0JNu6wnFqjkZtQw2HDw8j5oVsu9O+Kydwe2mLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e85c7b7f1e58055920b038262f887d0ad11d4f5cd7a967f81c6f45b9716017a1","last_reissued_at":"2026-05-18T00:32:31.219970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:31.219970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07008","source_version":3,"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:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7AWebrGSxBSFryRksAjhV07p/Bhd8080a2WxEwOnL+PuODMV+YySCkkL7cekiSR9aGrsc5pdurxgemqJj/nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:23:02.229136Z"},"content_sha256":"6d9207c02c801a432d3b29a71708bdee1b01a1b1c3aa46b7a6f393d34c64f889","schema_version":"1.0","event_id":"sha256:6d9207c02c801a432d3b29a71708bdee1b01a1b1c3aa46b7a6f393d34c64f889"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5BOHW7Y6LACVSIFQHATC7CD5BL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fine-Grained Complexity and Conditional Hardness for Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Udit Agarwal, Vijaya Ramachandran","submitted_at":"2016-11-21T20:53:21Z","abstract_excerpt":"We consider the fine-grained complexity of sparse graph problems that currently have $\\tilde{O}(mn)$ time algorithms, where m is the number of edges and n is the number of vertices in the input graph. This class includes several important path problems on both directed and undirected graphs, including APSP, MWC (minimum weight cycle), and Eccentricities, which is the problem of computing, for each vertex in the graph, the length of a longest shortest path starting at that vertex.\n  We introduce the notion of a sparse reduction which preserves the sparsity of graphs, and we present near linear-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07008","kind":"arxiv","version":3},"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:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6tzc9+Dkejc6CJz9nu5D7mhNSmzeUPSDwaBOCUkBsGRD12ZwnwBQlLc/iib5gL6wfAn32jPgEL2m/0yFRpiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:23:02.229506Z"},"content_sha256":"1f015f766883c8a936db2c0f4c62c83fd0333dab4e9f8146d674d2b507b87af7","schema_version":"1.0","event_id":"sha256:1f015f766883c8a936db2c0f4c62c83fd0333dab4e9f8146d674d2b507b87af7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BOHW7Y6LACVSIFQHATC7CD5BL/bundle.json","state_url":"https://pith.science/pith/5BOHW7Y6LACVSIFQHATC7CD5BL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BOHW7Y6LACVSIFQHATC7CD5BL/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-24T22:23:02Z","links":{"resolver":"https://pith.science/pith/5BOHW7Y6LACVSIFQHATC7CD5BL","bundle":"https://pith.science/pith/5BOHW7Y6LACVSIFQHATC7CD5BL/bundle.json","state":"https://pith.science/pith/5BOHW7Y6LACVSIFQHATC7CD5BL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BOHW7Y6LACVSIFQHATC7CD5BL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5BOHW7Y6LACVSIFQHATC7CD5BL","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":"43d862e1f5f3330a434790369f1214c426f404040630311f7be993801effb28a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T20:53:21Z","title_canon_sha256":"be461670f179118f7ef173641721e1ee46f76002db52f03a51749a7850287bd3"},"schema_version":"1.0","source":{"id":"1611.07008","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07008","created_at":"2026-05-18T00:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07008v3","created_at":"2026-05-18T00:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07008","created_at":"2026-05-18T00:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"5BOHW7Y6LACV","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5BOHW7Y6LACVSIFQ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5BOHW7Y6","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:1f015f766883c8a936db2c0f4c62c83fd0333dab4e9f8146d674d2b507b87af7","target":"graph","created_at":"2026-05-18T00:32:31Z","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 fine-grained complexity of sparse graph problems that currently have $\\tilde{O}(mn)$ time algorithms, where m is the number of edges and n is the number of vertices in the input graph. This class includes several important path problems on both directed and undirected graphs, including APSP, MWC (minimum weight cycle), and Eccentricities, which is the problem of computing, for each vertex in the graph, the length of a longest shortest path starting at that vertex.\n  We introduce the notion of a sparse reduction which preserves the sparsity of graphs, and we present near linear-","authors_text":"Udit Agarwal, Vijaya Ramachandran","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T20:53:21Z","title":"Fine-Grained Complexity and Conditional Hardness for Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07008","kind":"arxiv","version":3},"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:6d9207c02c801a432d3b29a71708bdee1b01a1b1c3aa46b7a6f393d34c64f889","target":"record","created_at":"2026-05-18T00:32:31Z","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":"43d862e1f5f3330a434790369f1214c426f404040630311f7be993801effb28a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T20:53:21Z","title_canon_sha256":"be461670f179118f7ef173641721e1ee46f76002db52f03a51749a7850287bd3"},"schema_version":"1.0","source":{"id":"1611.07008","kind":"arxiv","version":3}},"canonical_sha256":"e85c7b7f1e58055920b038262f887d0ad11d4f5cd7a967f81c6f45b9716017a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e85c7b7f1e58055920b038262f887d0ad11d4f5cd7a967f81c6f45b9716017a1","first_computed_at":"2026-05-18T00:32:31.219970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:31.219970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PbFZE4o0z0kzuzurg38buBesAjCyMij9PT7OpmTofdJyfLa0JNu6wnFqjkZtQw2HDw8j5oVsu9O+Kydwe2mLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:31.220571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07008","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d9207c02c801a432d3b29a71708bdee1b01a1b1c3aa46b7a6f393d34c64f889","sha256:1f015f766883c8a936db2c0f4c62c83fd0333dab4e9f8146d674d2b507b87af7"],"state_sha256":"4b8bb7e22e14bf298d4dfc6f7ee511a3f7495c146fb09a733677bd7d3e2f08d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OhwidMLfGWfnVWZinOhiV9hf7JjyVV2w5uWqGo71QXaPI2LSvEYtoeyb/h13jfmMKlTFr8aPiQGlYp8/2zdBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:23:02.231716Z","bundle_sha256":"6ca3af1aaf960b39bfa0a4faa1e7768410bbbe376cd36ea67b66d82d640c4be3"}}