{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RQTOKJMS2U4KFB4XIY54VHFLEV","short_pith_number":"pith:RQTOKJMS","canonical_record":{"source":{"id":"1112.1117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-05T23:12:31Z","cross_cats_sorted":[],"title_canon_sha256":"f8c56d84aff30ba6b7aa1c8158da1a26d1bc2b4072ec953b40c3691b2b02f4d8","abstract_canon_sha256":"75165f6eec1caa163387dcd7a02600445327b6d1c8d7a756e63183c2f52d8c99"},"schema_version":"1.0"},"canonical_sha256":"8c26e52592d538a28797463bca9cab2551165688ff7ea78e989b665e6b483a9f","source":{"kind":"arxiv","id":"1112.1117","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1117","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1117v2","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1117","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"RQTOKJMS2U4K","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQTOKJMS2U4KFB4X","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQTOKJMS","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RQTOKJMS2U4KFB4XIY54VHFLEV","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-05T23:12:31Z","cross_cats_sorted":[],"title_canon_sha256":"f8c56d84aff30ba6b7aa1c8158da1a26d1bc2b4072ec953b40c3691b2b02f4d8","abstract_canon_sha256":"75165f6eec1caa163387dcd7a02600445327b6d1c8d7a756e63183c2f52d8c99"},"schema_version":"1.0"},"canonical_sha256":"8c26e52592d538a28797463bca9cab2551165688ff7ea78e989b665e6b483a9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:27.974856Z","signature_b64":"/HmdUdhg1Utez9IU6ZckIGsQoUMcLdX81ttCwY9a1wJ/FMlRCqrIXHVchcwj3QrWKo+qOWxF3md8r2OxK1v3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c26e52592d538a28797463bca9cab2551165688ff7ea78e989b665e6b483a9f","last_reissued_at":"2026-05-18T02:21:27.974223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:27.974223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1117","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-18T02:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cp7Ob+BpcrUteRHcMtDhZJn6Tf9swWju6E2FSiYKuRc/Y4s9KmtfjfWVv+V2e8RgVdkeIO/31nFZwz8EbRBODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:55:23.675254Z"},"content_sha256":"1147985b0b40cc36db6d764e54d5f51439cbb103e1e5e5abb6b28237bc04f990","schema_version":"1.0","event_id":"sha256:1147985b0b40cc36db6d764e54d5f51439cbb103e1e5e5abb6b28237bc04f990"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RQTOKJMS2U4KFB4XIY54VHFLEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Heavy Paths in Graphs: A Rank Join Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Laks V. S. Lakshmanan, Mohammad Khabbaz, Smriti Bhagat","submitted_at":"2011-12-05T23:12:31Z","abstract_excerpt":"Graphs have been commonly used to model many applications. A natural problem which abstracts applications such as itinerary planning, playlist recommendation, and flow analysis in information networks is that of finding the heaviest path(s) in a graph. More precisely, we can model these applications as a graph with non-negative edge weights, along with a monotone function such as sum, which aggregates edge weights into a path weight, capturing some notion of quality. We are then interested in finding the top-k heaviest simple paths, i.e., the $k$ simple (cycle-free) paths with the greatest wei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1117","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-18T02:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69yXVPoiVGGtsgnd8+OgqJBehLPrAu8TZ0UidsinLrjpyZ5Auv1U92fUyRUhQgVaJ/nBhefdWPJH4kWMMgRzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:55:23.675823Z"},"content_sha256":"a5de7fcc2288f43cf6ee85434076c1ed013603945ba43c3c37c9b749ecf54e0e","schema_version":"1.0","event_id":"sha256:a5de7fcc2288f43cf6ee85434076c1ed013603945ba43c3c37c9b749ecf54e0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQTOKJMS2U4KFB4XIY54VHFLEV/bundle.json","state_url":"https://pith.science/pith/RQTOKJMS2U4KFB4XIY54VHFLEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQTOKJMS2U4KFB4XIY54VHFLEV/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-08T15:55:23Z","links":{"resolver":"https://pith.science/pith/RQTOKJMS2U4KFB4XIY54VHFLEV","bundle":"https://pith.science/pith/RQTOKJMS2U4KFB4XIY54VHFLEV/bundle.json","state":"https://pith.science/pith/RQTOKJMS2U4KFB4XIY54VHFLEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQTOKJMS2U4KFB4XIY54VHFLEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RQTOKJMS2U4KFB4XIY54VHFLEV","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":"75165f6eec1caa163387dcd7a02600445327b6d1c8d7a756e63183c2f52d8c99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-05T23:12:31Z","title_canon_sha256":"f8c56d84aff30ba6b7aa1c8158da1a26d1bc2b4072ec953b40c3691b2b02f4d8"},"schema_version":"1.0","source":{"id":"1112.1117","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1117","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1117v2","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1117","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"RQTOKJMS2U4K","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQTOKJMS2U4KFB4X","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQTOKJMS","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:a5de7fcc2288f43cf6ee85434076c1ed013603945ba43c3c37c9b749ecf54e0e","target":"graph","created_at":"2026-05-18T02:21:27Z","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":"Graphs have been commonly used to model many applications. A natural problem which abstracts applications such as itinerary planning, playlist recommendation, and flow analysis in information networks is that of finding the heaviest path(s) in a graph. More precisely, we can model these applications as a graph with non-negative edge weights, along with a monotone function such as sum, which aggregates edge weights into a path weight, capturing some notion of quality. We are then interested in finding the top-k heaviest simple paths, i.e., the $k$ simple (cycle-free) paths with the greatest wei","authors_text":"Laks V. S. Lakshmanan, Mohammad Khabbaz, Smriti Bhagat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-05T23:12:31Z","title":"Finding Heavy Paths in Graphs: A Rank Join Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1117","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:1147985b0b40cc36db6d764e54d5f51439cbb103e1e5e5abb6b28237bc04f990","target":"record","created_at":"2026-05-18T02:21:27Z","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":"75165f6eec1caa163387dcd7a02600445327b6d1c8d7a756e63183c2f52d8c99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-05T23:12:31Z","title_canon_sha256":"f8c56d84aff30ba6b7aa1c8158da1a26d1bc2b4072ec953b40c3691b2b02f4d8"},"schema_version":"1.0","source":{"id":"1112.1117","kind":"arxiv","version":2}},"canonical_sha256":"8c26e52592d538a28797463bca9cab2551165688ff7ea78e989b665e6b483a9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c26e52592d538a28797463bca9cab2551165688ff7ea78e989b665e6b483a9f","first_computed_at":"2026-05-18T02:21:27.974223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:27.974223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/HmdUdhg1Utez9IU6ZckIGsQoUMcLdX81ttCwY9a1wJ/FMlRCqrIXHVchcwj3QrWKo+qOWxF3md8r2OxK1v3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:27.974856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1117","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1147985b0b40cc36db6d764e54d5f51439cbb103e1e5e5abb6b28237bc04f990","sha256:a5de7fcc2288f43cf6ee85434076c1ed013603945ba43c3c37c9b749ecf54e0e"],"state_sha256":"80d1bad3f078df5ca89451c128a9daade37950c103af6c46854d479fddd65d8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Tx+XvhA4uFWnObnDbJ3zMqMtB88yz6+0mSrMppJ14kR9j+Z+IgqeQqcVeqn7SIbroHKOnbgDCZLgQrgi5mmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:55:23.679178Z","bundle_sha256":"59852b96779fbafe21e0e6e57f7d5ed16bb8a55b76583b54562ebd31fd11b920"}}