{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XX6J4D2OEJEVZOPMRUW6VQ5FVA","short_pith_number":"pith:XX6J4D2O","canonical_record":{"source":{"id":"1506.08564","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-06-29T09:52:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8f379cc5b3f91a703c27d817e7cf0850e76375e51e6a456fe3f5c3b66cbb3d50","abstract_canon_sha256":"707032a540207ff47156e1ff119595cf11e2eab5272c454d0a4d3d67ff5e7e1b"},"schema_version":"1.0"},"canonical_sha256":"bdfc9e0f4e22495cb9ec8d2deac3a5a82b83fc6d86d6ccf817c389478ffc86c4","source":{"kind":"arxiv","id":"1506.08564","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08564","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08564v2","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08564","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"XX6J4D2OEJEV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XX6J4D2OEJEVZOPM","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XX6J4D2O","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XX6J4D2OEJEVZOPMRUW6VQ5FVA","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08564","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-06-29T09:52:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8f379cc5b3f91a703c27d817e7cf0850e76375e51e6a456fe3f5c3b66cbb3d50","abstract_canon_sha256":"707032a540207ff47156e1ff119595cf11e2eab5272c454d0a4d3d67ff5e7e1b"},"schema_version":"1.0"},"canonical_sha256":"bdfc9e0f4e22495cb9ec8d2deac3a5a82b83fc6d86d6ccf817c389478ffc86c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:16.940528Z","signature_b64":"FaZJ9YWx7klSNnSDD2T868zMc3LdZv+RKv65FEncapkGgv4Ifmpk+uqxPRIXNDZRa5RC3RnSP+0x6T3S9AjvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdfc9e0f4e22495cb9ec8d2deac3a5a82b83fc6d86d6ccf817c389478ffc86c4","last_reissued_at":"2026-05-18T00:46:16.940069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:16.940069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08564","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-18T00:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEhnsNHhj1ghh6ELzdnkGflZSWdmzrEg289De7r/RkUqBJhOY/8HZvbOJsHuY8JrtfIhczkSOPN1qNx2i19NCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:36:42.458341Z"},"content_sha256":"f28cd58efbacd557686585a2c296e509f1faf42f3d912e80984a37bcdfd39d16","schema_version":"1.0","event_id":"sha256:f28cd58efbacd557686585a2c296e509f1faf42f3d912e80984a37bcdfd39d16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XX6J4D2OEJEVZOPMRUW6VQ5FVA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-passage percolation on Cartesian power graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Anders Martinsson","submitted_at":"2015-06-29T09:52:50Z","abstract_excerpt":"We consider first-passage percolation on the class of \"high-dimensional\" graphs that can be written as an iterated Cartesian product $G\\square G \\square \\dots \\square G$ of some base graph $G$ as the number of factors tends to infinity. We propose a natural asymptotic lower bound on the first-passage time between $(v, v, \\dots, v)$ and $(w, w, \\dots, w)$ as $n$, the number of factors, tends to infinity, which we call the critical time $t^*_G(v, w)$. Our main result characterizes when this lower bound is sharp as $n\\rightarrow\\infty$. As a corollary, we are able to determine the limit of the so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08564","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-18T00:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ya9MCZWXRDIdh2omuWxyLibGRI/w88cegp04oqBfbR5fseyroLpswiVz27EbOBc3Hbk1Gx4eShYs7XruQYZiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:36:42.458735Z"},"content_sha256":"20423183d10cddaf76d0a346da38514d74e156927cdcd09dc53f5aa2b91a20eb","schema_version":"1.0","event_id":"sha256:20423183d10cddaf76d0a346da38514d74e156927cdcd09dc53f5aa2b91a20eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XX6J4D2OEJEVZOPMRUW6VQ5FVA/bundle.json","state_url":"https://pith.science/pith/XX6J4D2OEJEVZOPMRUW6VQ5FVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XX6J4D2OEJEVZOPMRUW6VQ5FVA/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-02T11:36:42Z","links":{"resolver":"https://pith.science/pith/XX6J4D2OEJEVZOPMRUW6VQ5FVA","bundle":"https://pith.science/pith/XX6J4D2OEJEVZOPMRUW6VQ5FVA/bundle.json","state":"https://pith.science/pith/XX6J4D2OEJEVZOPMRUW6VQ5FVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XX6J4D2OEJEVZOPMRUW6VQ5FVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XX6J4D2OEJEVZOPMRUW6VQ5FVA","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":"707032a540207ff47156e1ff119595cf11e2eab5272c454d0a4d3d67ff5e7e1b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-06-29T09:52:50Z","title_canon_sha256":"8f379cc5b3f91a703c27d817e7cf0850e76375e51e6a456fe3f5c3b66cbb3d50"},"schema_version":"1.0","source":{"id":"1506.08564","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08564","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08564v2","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08564","created_at":"2026-05-18T00:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"XX6J4D2OEJEV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XX6J4D2OEJEVZOPM","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XX6J4D2O","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:20423183d10cddaf76d0a346da38514d74e156927cdcd09dc53f5aa2b91a20eb","target":"graph","created_at":"2026-05-18T00:46:16Z","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 first-passage percolation on the class of \"high-dimensional\" graphs that can be written as an iterated Cartesian product $G\\square G \\square \\dots \\square G$ of some base graph $G$ as the number of factors tends to infinity. We propose a natural asymptotic lower bound on the first-passage time between $(v, v, \\dots, v)$ and $(w, w, \\dots, w)$ as $n$, the number of factors, tends to infinity, which we call the critical time $t^*_G(v, w)$. Our main result characterizes when this lower bound is sharp as $n\\rightarrow\\infty$. As a corollary, we are able to determine the limit of the so","authors_text":"Anders Martinsson","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-06-29T09:52:50Z","title":"First-passage percolation on Cartesian power graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08564","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:f28cd58efbacd557686585a2c296e509f1faf42f3d912e80984a37bcdfd39d16","target":"record","created_at":"2026-05-18T00:46:16Z","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":"707032a540207ff47156e1ff119595cf11e2eab5272c454d0a4d3d67ff5e7e1b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-06-29T09:52:50Z","title_canon_sha256":"8f379cc5b3f91a703c27d817e7cf0850e76375e51e6a456fe3f5c3b66cbb3d50"},"schema_version":"1.0","source":{"id":"1506.08564","kind":"arxiv","version":2}},"canonical_sha256":"bdfc9e0f4e22495cb9ec8d2deac3a5a82b83fc6d86d6ccf817c389478ffc86c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdfc9e0f4e22495cb9ec8d2deac3a5a82b83fc6d86d6ccf817c389478ffc86c4","first_computed_at":"2026-05-18T00:46:16.940069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:16.940069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FaZJ9YWx7klSNnSDD2T868zMc3LdZv+RKv65FEncapkGgv4Ifmpk+uqxPRIXNDZRa5RC3RnSP+0x6T3S9AjvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:16.940528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08564","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f28cd58efbacd557686585a2c296e509f1faf42f3d912e80984a37bcdfd39d16","sha256:20423183d10cddaf76d0a346da38514d74e156927cdcd09dc53f5aa2b91a20eb"],"state_sha256":"a7a0d70bf0d6ba33ce9a631e5981dea837b087b952f6862264dbe15d5a4c5264"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Lj4YIlvcXi6unUr7z4SK54uVetw17IBbk/V4fKlJJoHMNo4QfYpQV9rm4hDVUPAaZnRSNsxkr0N9hCjrC5JAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:36:42.461067Z","bundle_sha256":"0e69acfec3b025acbd6572c67a0da8884899653ca92dff4fe8565ce5b3db9c6c"}}