{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:N257FSXN4L2YHX4JOERRMMV256","short_pith_number":"pith:N257FSXN","schema_version":"1.0","canonical_sha256":"6ebbf2caede2f583df8971231632baef9b31e6dc0f552452f6b52ad36f29ab9c","source":{"kind":"arxiv","id":"2309.11840","version":3},"attestation_state":"computed","paper":{"title":"Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO","q-bio.PE"],"primary_cat":"math.PR","authors_text":"Johannes Lengler, John Lapinskas, J\\'ulia Komj\\'athy, Ulysse Schaller","submitted_at":"2023-09-21T07:31:09Z","abstract_excerpt":"One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the classical iid transmission time $L_{xy}$ is multiplied by $(W_xW_y)^\\mu$, a polynomial of the expected degrees $W_x, W_y$ of the endpoints of the edge $xy$, which we call the penalty function. Beyond the Markov case, we also allow any distribution for $L_{xy}$ with regularly varying distribution near $0$. We then run this process on three spatial scale-free random graph models: finite and infinite Geometric In"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2309.11840","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-09-21T07:31:09Z","cross_cats_sorted":["cs.SI","math.CO","q-bio.PE"],"title_canon_sha256":"55d8ef6cd59d74fb91ef49dc166756f5840bb1045ebb2a988571cbe2601723ab","abstract_canon_sha256":"f5e7e35e88faf516429efc4970e4a5f94917990a5e08233d9c8cdf522da1d5d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:59:53.345151Z","signature_b64":"dUUV0fS0FDg5l/h9+khLhwOUX0gYvVzhZyW1PsM7LDiIabdiFh2ptwzZ7Qb1G8gqVPLBuFlZINiT1hYskj9NBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ebbf2caede2f583df8971231632baef9b31e6dc0f552452f6b52ad36f29ab9c","last_reissued_at":"2026-07-05T07:59:53.344677Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:59:53.344677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO","q-bio.PE"],"primary_cat":"math.PR","authors_text":"Johannes Lengler, John Lapinskas, J\\'ulia Komj\\'athy, Ulysse Schaller","submitted_at":"2023-09-21T07:31:09Z","abstract_excerpt":"One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the classical iid transmission time $L_{xy}$ is multiplied by $(W_xW_y)^\\mu$, a polynomial of the expected degrees $W_x, W_y$ of the endpoints of the edge $xy$, which we call the penalty function. Beyond the Markov case, we also allow any distribution for $L_{xy}$ with regularly varying distribution near $0$. We then run this process on three spatial scale-free random graph models: finite and infinite Geometric In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.11840","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.11840/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.11840","created_at":"2026-07-05T07:59:53.344736+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.11840v3","created_at":"2026-07-05T07:59:53.344736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.11840","created_at":"2026-07-05T07:59:53.344736+00:00"},{"alias_kind":"pith_short_12","alias_value":"N257FSXN4L2Y","created_at":"2026-07-05T07:59:53.344736+00:00"},{"alias_kind":"pith_short_16","alias_value":"N257FSXN4L2YHX4J","created_at":"2026-07-05T07:59:53.344736+00:00"},{"alias_kind":"pith_short_8","alias_value":"N257FSXN","created_at":"2026-07-05T07:59:53.344736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09415","citing_title":"The spectrum of dense kernel-based random graphs","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N257FSXN4L2YHX4JOERRMMV256","json":"https://pith.science/pith/N257FSXN4L2YHX4JOERRMMV256.json","graph_json":"https://pith.science/api/pith-number/N257FSXN4L2YHX4JOERRMMV256/graph.json","events_json":"https://pith.science/api/pith-number/N257FSXN4L2YHX4JOERRMMV256/events.json","paper":"https://pith.science/paper/N257FSXN"},"agent_actions":{"view_html":"https://pith.science/pith/N257FSXN4L2YHX4JOERRMMV256","download_json":"https://pith.science/pith/N257FSXN4L2YHX4JOERRMMV256.json","view_paper":"https://pith.science/paper/N257FSXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.11840&json=true","fetch_graph":"https://pith.science/api/pith-number/N257FSXN4L2YHX4JOERRMMV256/graph.json","fetch_events":"https://pith.science/api/pith-number/N257FSXN4L2YHX4JOERRMMV256/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N257FSXN4L2YHX4JOERRMMV256/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N257FSXN4L2YHX4JOERRMMV256/action/storage_attestation","attest_author":"https://pith.science/pith/N257FSXN4L2YHX4JOERRMMV256/action/author_attestation","sign_citation":"https://pith.science/pith/N257FSXN4L2YHX4JOERRMMV256/action/citation_signature","submit_replication":"https://pith.science/pith/N257FSXN4L2YHX4JOERRMMV256/action/replication_record"}},"created_at":"2026-07-05T07:59:53.344736+00:00","updated_at":"2026-07-05T07:59:53.344736+00:00"}