{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:C4DO6ZOZHNEOFIU3YCGSZPRGNQ","short_pith_number":"pith:C4DO6ZOZ","canonical_record":{"source":{"id":"2409.02812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-04T15:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"3e005cd81f47f359434c0b7b4889d25dfa333d97c105601f0936c96d14f810c2","abstract_canon_sha256":"aec9b3af74c298a0198ef49624f1d09331b732326925c854fa4093c9dc6535c1"},"schema_version":"1.0"},"canonical_sha256":"1706ef65d93b48e2a29bc08d2cbe266c21dec31ec5482cad4353a129dd743185","source":{"kind":"arxiv","id":"2409.02812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.02812","created_at":"2026-07-05T09:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"2409.02812v1","created_at":"2026-07-05T09:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02812","created_at":"2026-07-05T09:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"C4DO6ZOZHNEO","created_at":"2026-07-05T09:03:10Z"},{"alias_kind":"pith_short_16","alias_value":"C4DO6ZOZHNEOFIU3","created_at":"2026-07-05T09:03:10Z"},{"alias_kind":"pith_short_8","alias_value":"C4DO6ZOZ","created_at":"2026-07-05T09:03:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:C4DO6ZOZHNEOFIU3YCGSZPRGNQ","target":"record","payload":{"canonical_record":{"source":{"id":"2409.02812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-04T15:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"3e005cd81f47f359434c0b7b4889d25dfa333d97c105601f0936c96d14f810c2","abstract_canon_sha256":"aec9b3af74c298a0198ef49624f1d09331b732326925c854fa4093c9dc6535c1"},"schema_version":"1.0"},"canonical_sha256":"1706ef65d93b48e2a29bc08d2cbe266c21dec31ec5482cad4353a129dd743185","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:10.475711Z","signature_b64":"kCCXD7j/Bta0wWLIOXTuYpBCNbZfmsWFFfcJB57AnmHE3Jxeuln9cgBq9rGwGeZZZSZYhzwzRpNjkYqQEPcdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1706ef65d93b48e2a29bc08d2cbe266c21dec31ec5482cad4353a129dd743185","last_reissued_at":"2026-07-05T09:03:10.475222Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:10.475222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.02812","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-07-05T09:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFEbbQCuuaVqjw5kltJjzDuQe2BJ9N7/IJgjwxg9cHJfj0PGeTvlQeAuBxDhjZnjrD070jTP17mKb05e8JT+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T12:18:00.272696Z"},"content_sha256":"65c44136c0aedfbb4bc1252ba2a8d239df9b271acd75c835655d97883d5a0693","schema_version":"1.0","event_id":"sha256:65c44136c0aedfbb4bc1252ba2a8d239df9b271acd75c835655d97883d5a0693"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:C4DO6ZOZHNEOFIU3YCGSZPRGNQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing and finding paths in sparse random graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julien Portier, Leo Versteegen, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2024-09-04T15:31:23Z","abstract_excerpt":"Let $G\\sim G(n,p)$ be a (hidden) Erd\\H{o}s-R\\'enyi random graph with $p=(1+ \\varepsilon)/n$ for some fixed constant $ \\varepsilon >0$. Ferber, Krivelevich, Sudakov, and Vieira showed that to reveal a path of length $\\ell=\\Omega\\left(\\frac{\\log(1/ \\varepsilon)}{ \\varepsilon}\\right)$ in $G$ with high probability, one must query the adjacency of $\\Omega\\left(\\frac{\\ell}{p \\varepsilon\\log(1/ \\varepsilon)}\\right)$ pairs of vertices in $G$, where each query may depend on the outcome of all previous queries. Their result is tight up to the factor of $\\log(1/ \\varepsilon)$ in both $\\ell$ and the numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02812","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.02812/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"},"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-07-05T09:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLTAGsWiWrXDl/IjsvolT5HYPcfkouwGgDtmPykfz6Ns38fflzmYB1i9HovfgvmCBbo/eVqtesv0SGYzVGfQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T12:18:00.273071Z"},"content_sha256":"5286918e5755dc4f99f876af507f4250ddb00728f52ee3753e1339ac5e9488a5","schema_version":"1.0","event_id":"sha256:5286918e5755dc4f99f876af507f4250ddb00728f52ee3753e1339ac5e9488a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4DO6ZOZHNEOFIU3YCGSZPRGNQ/bundle.json","state_url":"https://pith.science/pith/C4DO6ZOZHNEOFIU3YCGSZPRGNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4DO6ZOZHNEOFIU3YCGSZPRGNQ/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-07-26T12:18:00Z","links":{"resolver":"https://pith.science/pith/C4DO6ZOZHNEOFIU3YCGSZPRGNQ","bundle":"https://pith.science/pith/C4DO6ZOZHNEOFIU3YCGSZPRGNQ/bundle.json","state":"https://pith.science/pith/C4DO6ZOZHNEOFIU3YCGSZPRGNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4DO6ZOZHNEOFIU3YCGSZPRGNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:C4DO6ZOZHNEOFIU3YCGSZPRGNQ","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":"aec9b3af74c298a0198ef49624f1d09331b732326925c854fa4093c9dc6535c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-04T15:31:23Z","title_canon_sha256":"3e005cd81f47f359434c0b7b4889d25dfa333d97c105601f0936c96d14f810c2"},"schema_version":"1.0","source":{"id":"2409.02812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.02812","created_at":"2026-07-05T09:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"2409.02812v1","created_at":"2026-07-05T09:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02812","created_at":"2026-07-05T09:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"C4DO6ZOZHNEO","created_at":"2026-07-05T09:03:10Z"},{"alias_kind":"pith_short_16","alias_value":"C4DO6ZOZHNEOFIU3","created_at":"2026-07-05T09:03:10Z"},{"alias_kind":"pith_short_8","alias_value":"C4DO6ZOZ","created_at":"2026-07-05T09:03:10Z"}],"graph_snapshots":[{"event_id":"sha256:5286918e5755dc4f99f876af507f4250ddb00728f52ee3753e1339ac5e9488a5","target":"graph","created_at":"2026-07-05T09:03:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.02812/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G\\sim G(n,p)$ be a (hidden) Erd\\H{o}s-R\\'enyi random graph with $p=(1+ \\varepsilon)/n$ for some fixed constant $ \\varepsilon >0$. Ferber, Krivelevich, Sudakov, and Vieira showed that to reveal a path of length $\\ell=\\Omega\\left(\\frac{\\log(1/ \\varepsilon)}{ \\varepsilon}\\right)$ in $G$ with high probability, one must query the adjacency of $\\Omega\\left(\\frac{\\ell}{p \\varepsilon\\log(1/ \\varepsilon)}\\right)$ pairs of vertices in $G$, where each query may depend on the outcome of all previous queries. Their result is tight up to the factor of $\\log(1/ \\varepsilon)$ in both $\\ell$ and the numbe","authors_text":"Julien Portier, Leo Versteegen, Vesna Ir\\v{s}i\\v{c}","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-04T15:31:23Z","title":"Packing and finding paths in sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02812","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:65c44136c0aedfbb4bc1252ba2a8d239df9b271acd75c835655d97883d5a0693","target":"record","created_at":"2026-07-05T09:03:10Z","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":"aec9b3af74c298a0198ef49624f1d09331b732326925c854fa4093c9dc6535c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-04T15:31:23Z","title_canon_sha256":"3e005cd81f47f359434c0b7b4889d25dfa333d97c105601f0936c96d14f810c2"},"schema_version":"1.0","source":{"id":"2409.02812","kind":"arxiv","version":1}},"canonical_sha256":"1706ef65d93b48e2a29bc08d2cbe266c21dec31ec5482cad4353a129dd743185","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1706ef65d93b48e2a29bc08d2cbe266c21dec31ec5482cad4353a129dd743185","first_computed_at":"2026-07-05T09:03:10.475222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:03:10.475222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kCCXD7j/Bta0wWLIOXTuYpBCNbZfmsWFFfcJB57AnmHE3Jxeuln9cgBq9rGwGeZZZSZYhzwzRpNjkYqQEPcdBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:03:10.475711Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.02812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65c44136c0aedfbb4bc1252ba2a8d239df9b271acd75c835655d97883d5a0693","sha256:5286918e5755dc4f99f876af507f4250ddb00728f52ee3753e1339ac5e9488a5"],"state_sha256":"4e91b32b071ffef8db06c5746edda5e3c03d33835a87d9bc92d09dd265607099"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKIYbMreidcS9ZOqghpZ8YDMRUQpcyWDdXZ9h7QQwqYX35mZlhpA1AX6ht7hvk9AF1eEmx5WqQzomydGJxtODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T12:18:00.275224Z","bundle_sha256":"c49600f15eda9667e1b2419260ee3ab10106d07b54073f56387fc482672d3820"}}