{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:O4TD37HH7H5HMXFHP6NKIN7B5Y","short_pith_number":"pith:O4TD37HH","canonical_record":{"source":{"id":"1512.04010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-13T06:26:57Z","cross_cats_sorted":[],"title_canon_sha256":"4937ddd7719121b54f19a46cef45cb44bbea318934f283d4fa3a5293c96ac982","abstract_canon_sha256":"bf891bbf402dabfd0f867127526e244cb12231c00815c6d4f2379646a24c3a44"},"schema_version":"1.0"},"canonical_sha256":"77263dfce7f9fa765ca77f9aa437e1ee21aa04ea47fd8c3757917836a52c9cbb","source":{"kind":"arxiv","id":"1512.04010","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04010","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04010v1","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04010","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"pith_short_12","alias_value":"O4TD37HH7H5H","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4TD37HH7H5HMXFH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4TD37HH","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:O4TD37HH7H5HMXFHP6NKIN7B5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1512.04010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-13T06:26:57Z","cross_cats_sorted":[],"title_canon_sha256":"4937ddd7719121b54f19a46cef45cb44bbea318934f283d4fa3a5293c96ac982","abstract_canon_sha256":"bf891bbf402dabfd0f867127526e244cb12231c00815c6d4f2379646a24c3a44"},"schema_version":"1.0"},"canonical_sha256":"77263dfce7f9fa765ca77f9aa437e1ee21aa04ea47fd8c3757917836a52c9cbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:23.365371Z","signature_b64":"RrdfNYL2/yJsfI3rViY7mdVs9533fGd5HJe1jNnqKnevvG808DR6lGBqYeRxqtqRbAzhNg62rKDuF+m9gahLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77263dfce7f9fa765ca77f9aa437e1ee21aa04ea47fd8c3757917836a52c9cbb","last_reissued_at":"2026-05-18T01:24:23.364848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:23.364848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.04010","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-18T01:24:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXEQnok27ZxuGHr1h033LUrwG2sm59HcxN4lYl3xSuQMVvykntgnP0IO5JwM+Vd54XEqCUUetVibmjxfAaXOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:33:37.723967Z"},"content_sha256":"f4691830d4903278e03310f6893e49cf27da7aa94055ebcf174d1e6957406f43","schema_version":"1.0","event_id":"sha256:f4691830d4903278e03310f6893e49cf27da7aa94055ebcf174d1e6957406f43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:O4TD37HH7H5HMXFHP6NKIN7B5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding HeavyPaths in Weighted Graphs and a Case-Study on Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mohammad Khabbaz","submitted_at":"2015-12-13T06:26:57Z","abstract_excerpt":"A heavy path in a weighted graph represents a notion of connectivity and ordering that goes beyond two nodes. The heaviest path of length l in the graph, simply means a sequence of nodes with edges between them, such that the sum of edge weights is maximum among all paths of length l. It is trivial to state the heaviest edge in the graph is the heaviest path of length 1, that represents a heavy connection between (any) two existing nodes. This can be generalized in many different ways for more than two nodes, one of which is finding the heavy weight paths in the graph. In an influence network,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04010","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-18T01:24:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xwhbhQZ+gJ9rAyloA7bZ4RqCphTrSwzIkbveptYZMbkWROfTUVTIPli8fzwF0o/NklYi2l2hFxAdQj/dWukzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:33:37.724691Z"},"content_sha256":"634ce1544dd94d1584e4d15f108f43d28a934b8ed35c328a8a762325369eb517","schema_version":"1.0","event_id":"sha256:634ce1544dd94d1584e4d15f108f43d28a934b8ed35c328a8a762325369eb517"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4TD37HH7H5HMXFHP6NKIN7B5Y/bundle.json","state_url":"https://pith.science/pith/O4TD37HH7H5HMXFHP6NKIN7B5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4TD37HH7H5HMXFHP6NKIN7B5Y/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-08T19:33:37Z","links":{"resolver":"https://pith.science/pith/O4TD37HH7H5HMXFHP6NKIN7B5Y","bundle":"https://pith.science/pith/O4TD37HH7H5HMXFHP6NKIN7B5Y/bundle.json","state":"https://pith.science/pith/O4TD37HH7H5HMXFHP6NKIN7B5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4TD37HH7H5HMXFHP6NKIN7B5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:O4TD37HH7H5HMXFHP6NKIN7B5Y","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":"bf891bbf402dabfd0f867127526e244cb12231c00815c6d4f2379646a24c3a44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-13T06:26:57Z","title_canon_sha256":"4937ddd7719121b54f19a46cef45cb44bbea318934f283d4fa3a5293c96ac982"},"schema_version":"1.0","source":{"id":"1512.04010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04010","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04010v1","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04010","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"pith_short_12","alias_value":"O4TD37HH7H5H","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4TD37HH7H5HMXFH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4TD37HH","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:634ce1544dd94d1584e4d15f108f43d28a934b8ed35c328a8a762325369eb517","target":"graph","created_at":"2026-05-18T01:24:23Z","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":"A heavy path in a weighted graph represents a notion of connectivity and ordering that goes beyond two nodes. The heaviest path of length l in the graph, simply means a sequence of nodes with edges between them, such that the sum of edge weights is maximum among all paths of length l. It is trivial to state the heaviest edge in the graph is the heaviest path of length 1, that represents a heavy connection between (any) two existing nodes. This can be generalized in many different ways for more than two nodes, one of which is finding the heavy weight paths in the graph. In an influence network,","authors_text":"Mohammad Khabbaz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-13T06:26:57Z","title":"Finding HeavyPaths in Weighted Graphs and a Case-Study on Community Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04010","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:f4691830d4903278e03310f6893e49cf27da7aa94055ebcf174d1e6957406f43","target":"record","created_at":"2026-05-18T01:24:23Z","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":"bf891bbf402dabfd0f867127526e244cb12231c00815c6d4f2379646a24c3a44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-13T06:26:57Z","title_canon_sha256":"4937ddd7719121b54f19a46cef45cb44bbea318934f283d4fa3a5293c96ac982"},"schema_version":"1.0","source":{"id":"1512.04010","kind":"arxiv","version":1}},"canonical_sha256":"77263dfce7f9fa765ca77f9aa437e1ee21aa04ea47fd8c3757917836a52c9cbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77263dfce7f9fa765ca77f9aa437e1ee21aa04ea47fd8c3757917836a52c9cbb","first_computed_at":"2026-05-18T01:24:23.364848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:23.364848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RrdfNYL2/yJsfI3rViY7mdVs9533fGd5HJe1jNnqKnevvG808DR6lGBqYeRxqtqRbAzhNg62rKDuF+m9gahLBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:23.365371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4691830d4903278e03310f6893e49cf27da7aa94055ebcf174d1e6957406f43","sha256:634ce1544dd94d1584e4d15f108f43d28a934b8ed35c328a8a762325369eb517"],"state_sha256":"35b2928ba5096bd95cbb922291ac32c7edd925f00a5777a7aa170a2ff39192a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eKC6Vesz9MG4Z5Zba3UsbCaJUi4gRDPBNuFAGnfv+Vp852PBK5BSbkE3fHj8Komeo/eu+8odBL58tcdTwQ2eDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:33:37.729074Z","bundle_sha256":"0964b2adc2bacf3d71edf0f1d935afe8b20325a8bd975c592f527b96d59c1375"}}