{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UC7I6LLUIN3UEGRW67QGOCOJ74","short_pith_number":"pith:UC7I6LLU","canonical_record":{"source":{"id":"1808.02726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-08T11:19:52Z","cross_cats_sorted":[],"title_canon_sha256":"ba40264ccd7104d7de435cc2ae27212396db86af83b0e264c230ef6d0a7b62c6","abstract_canon_sha256":"85aba8ec1fe58fc7f72caf6c1e9541bc68252e8c5f1a1b9af2807d2f3d9d1c04"},"schema_version":"1.0"},"canonical_sha256":"a0be8f2d744377421a36f7e06709c9ff2f4df5f6991d48debec14c2240e35e13","source":{"kind":"arxiv","id":"1808.02726","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02726","created_at":"2026-05-18T00:08:32Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02726v1","created_at":"2026-05-18T00:08:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02726","created_at":"2026-05-18T00:08:32Z"},{"alias_kind":"pith_short_12","alias_value":"UC7I6LLUIN3U","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UC7I6LLUIN3UEGRW","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UC7I6LLU","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UC7I6LLUIN3UEGRW67QGOCOJ74","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-08T11:19:52Z","cross_cats_sorted":[],"title_canon_sha256":"ba40264ccd7104d7de435cc2ae27212396db86af83b0e264c230ef6d0a7b62c6","abstract_canon_sha256":"85aba8ec1fe58fc7f72caf6c1e9541bc68252e8c5f1a1b9af2807d2f3d9d1c04"},"schema_version":"1.0"},"canonical_sha256":"a0be8f2d744377421a36f7e06709c9ff2f4df5f6991d48debec14c2240e35e13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:32.359613Z","signature_b64":"GqIIrW/aoz7TXaFSnN+TyJOiIIQEDU5K5o+QE143Mtu4dntxzIVFwDz0u9cake+d4P8dG0Z5GG9xmK3hMT60DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0be8f2d744377421a36f7e06709c9ff2f4df5f6991d48debec14c2240e35e13","last_reissued_at":"2026-05-18T00:08:32.358903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:32.358903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02726","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-18T00:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4GCo08Mh51q88TE4/Loi4qOcTa39STF/pXR8qiugDh2ZbGZzmcoxazG7yS8SRRTdswYBu8R+ErXE0tj1NWZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:01:46.237628Z"},"content_sha256":"e11792b8a84af3328b019aef11d4ae7d95649280dcddc9dddcedf9c5a1471515","schema_version":"1.0","event_id":"sha256:e11792b8a84af3328b019aef11d4ae7d95649280dcddc9dddcedf9c5a1471515"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UC7I6LLUIN3UEGRW67QGOCOJ74","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Limiting properties of random graph models with vertex and edge weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sergey Foss, Takis Konstantopoulos","submitted_at":"2018-08-08T11:19:52Z","abstract_excerpt":"This paper provides an overview of results, concerning longest or heaviest paths, in the area of random directed graphs on the integers along with some extensions. We study first-order asymptotics of heaviest paths allowing weights both on edges and vertices and assuming that weights on edges are signed. We aim at an exposition that summarizes, simplifies, and extends proof ideas. We also study sparse graph asymptotics, showing convergence of the weighted random graphs to a certain weighted graph that can be constructed in terms of Poisson processes. We are motivated by numerous applications, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02726","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-18T00:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7LNd0V8hAnU6/zjO5K6TYuNmZoKNGTflbs8Q1omevlKuVArpyl14JyjXEj60JibMt0CJEI8Scx2rDoqDVAboCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:01:46.238283Z"},"content_sha256":"1f3855841c44884449ae491ae95747ee42c07651e647341548a63a5c55f0befb","schema_version":"1.0","event_id":"sha256:1f3855841c44884449ae491ae95747ee42c07651e647341548a63a5c55f0befb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UC7I6LLUIN3UEGRW67QGOCOJ74/bundle.json","state_url":"https://pith.science/pith/UC7I6LLUIN3UEGRW67QGOCOJ74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UC7I6LLUIN3UEGRW67QGOCOJ74/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-08T02:01:46Z","links":{"resolver":"https://pith.science/pith/UC7I6LLUIN3UEGRW67QGOCOJ74","bundle":"https://pith.science/pith/UC7I6LLUIN3UEGRW67QGOCOJ74/bundle.json","state":"https://pith.science/pith/UC7I6LLUIN3UEGRW67QGOCOJ74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UC7I6LLUIN3UEGRW67QGOCOJ74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UC7I6LLUIN3UEGRW67QGOCOJ74","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":"85aba8ec1fe58fc7f72caf6c1e9541bc68252e8c5f1a1b9af2807d2f3d9d1c04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-08T11:19:52Z","title_canon_sha256":"ba40264ccd7104d7de435cc2ae27212396db86af83b0e264c230ef6d0a7b62c6"},"schema_version":"1.0","source":{"id":"1808.02726","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02726","created_at":"2026-05-18T00:08:32Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02726v1","created_at":"2026-05-18T00:08:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02726","created_at":"2026-05-18T00:08:32Z"},{"alias_kind":"pith_short_12","alias_value":"UC7I6LLUIN3U","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UC7I6LLUIN3UEGRW","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UC7I6LLU","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:1f3855841c44884449ae491ae95747ee42c07651e647341548a63a5c55f0befb","target":"graph","created_at":"2026-05-18T00:08:32Z","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":"This paper provides an overview of results, concerning longest or heaviest paths, in the area of random directed graphs on the integers along with some extensions. We study first-order asymptotics of heaviest paths allowing weights both on edges and vertices and assuming that weights on edges are signed. We aim at an exposition that summarizes, simplifies, and extends proof ideas. We also study sparse graph asymptotics, showing convergence of the weighted random graphs to a certain weighted graph that can be constructed in terms of Poisson processes. We are motivated by numerous applications, ","authors_text":"Sergey Foss, Takis Konstantopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-08T11:19:52Z","title":"Limiting properties of random graph models with vertex and edge weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02726","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:e11792b8a84af3328b019aef11d4ae7d95649280dcddc9dddcedf9c5a1471515","target":"record","created_at":"2026-05-18T00:08:32Z","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":"85aba8ec1fe58fc7f72caf6c1e9541bc68252e8c5f1a1b9af2807d2f3d9d1c04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-08T11:19:52Z","title_canon_sha256":"ba40264ccd7104d7de435cc2ae27212396db86af83b0e264c230ef6d0a7b62c6"},"schema_version":"1.0","source":{"id":"1808.02726","kind":"arxiv","version":1}},"canonical_sha256":"a0be8f2d744377421a36f7e06709c9ff2f4df5f6991d48debec14c2240e35e13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0be8f2d744377421a36f7e06709c9ff2f4df5f6991d48debec14c2240e35e13","first_computed_at":"2026-05-18T00:08:32.358903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:32.358903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GqIIrW/aoz7TXaFSnN+TyJOiIIQEDU5K5o+QE143Mtu4dntxzIVFwDz0u9cake+d4P8dG0Z5GG9xmK3hMT60DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:32.359613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02726","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e11792b8a84af3328b019aef11d4ae7d95649280dcddc9dddcedf9c5a1471515","sha256:1f3855841c44884449ae491ae95747ee42c07651e647341548a63a5c55f0befb"],"state_sha256":"d2a91a833f29b076d9beda77c9cf8eed03359367e2fff3dfcf0605681b27c7df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9pucpJXprkFqFx4kpNrvZUPWgPA+Bb3kbsiDWVZuCSYikV5Qfxjwu27yxcyvNpkglO8Fz+CVAyY30uR6Z+pCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:01:46.241902Z","bundle_sha256":"0feb91afdcf5de0e62378305c727d90de09d34c28d4931f2f47e224c28b577cc"}}