{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WRQED4BVZL4ZY6LW4P2VVGTZ7Z","short_pith_number":"pith:WRQED4BV","canonical_record":{"source":{"id":"1505.00734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-04T18:02:51Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e0b42cd2e160c41d6b12fad76f558ff0c57034f3e783ded327fb04f35b6a30dd","abstract_canon_sha256":"0e5b49c5641447add82ece2773159ba29f224c90a714f74b6f21689e069d588d"},"schema_version":"1.0"},"canonical_sha256":"b46041f035caf99c7976e3f55a9a79fe613847abd3d9d9c01add81cfcbf6a068","source":{"kind":"arxiv","id":"1505.00734","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00734","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00734v2","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00734","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"WRQED4BVZL4Z","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WRQED4BVZL4ZY6LW","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WRQED4BV","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WRQED4BVZL4ZY6LW4P2VVGTZ7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1505.00734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-04T18:02:51Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e0b42cd2e160c41d6b12fad76f558ff0c57034f3e783ded327fb04f35b6a30dd","abstract_canon_sha256":"0e5b49c5641447add82ece2773159ba29f224c90a714f74b6f21689e069d588d"},"schema_version":"1.0"},"canonical_sha256":"b46041f035caf99c7976e3f55a9a79fe613847abd3d9d9c01add81cfcbf6a068","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:55.338469Z","signature_b64":"Qc92q+FDzSfdbMeZO1ACu+bus24mYU4+JsNLu4tOTzDu/C/9KXkjCRoNRIMpyKQbnIWvgefGGkb53NWvZkmhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b46041f035caf99c7976e3f55a9a79fe613847abd3d9d9c01add81cfcbf6a068","last_reissued_at":"2026-05-18T01:09:55.336309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:55.336309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.00734","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-18T01:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEslbXml5XcXmXQv9/Bl5ApBgx62D5RhKfS1U4d3z03p9WANdM14uLcXMY4L1wJXOBM/3Oiwm+3TqSnOn1/RBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:12:32.807226Z"},"content_sha256":"0c09b6bbe4321c83635bc13dbcb2c55bd0f4415b958ef7bcbf8ae72b7fc2ca3c","schema_version":"1.0","event_id":"sha256:0c09b6bbe4321c83635bc13dbcb2c55bd0f4415b958ef7bcbf8ae72b7fc2ca3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WRQED4BVZL4ZY6LW4P2VVGTZ7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding paths in sparse random graphs requires many queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Michael Krivelevich, Pedro Vieira","submitted_at":"2015-05-04T18:02:51Z","abstract_excerpt":"We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph $G\\sim {\\mathcal G}(n,p)$ in order to find a subgraph which possesses some target property with high probability. In this paper we focus on finding long paths in $G\\sim \\mathcal G(n,p)$ when $p=\\frac{1+\\varepsilon}{n}$ for some fixed constant $\\varepsilon>0$. This random graph is known to have typically linearly long paths.\n  To have $\\ell$ edges with high probability in $G\\sim \\mathcal G(n,p)$ one clearly needs to query"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00734","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-18T01:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGOBp/DJIkxxNxVQNDgJK9pF0kilCzDPiVPTlHCW7jCqmGuECVvpd09yqkvJt5D+Xmtm6hDuzlAGWIcqVgIUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:12:32.807915Z"},"content_sha256":"d36fd6fde6678c3e2df37a2c08debcb8b34ba2f3fb945c52c5af85313dfff92a","schema_version":"1.0","event_id":"sha256:d36fd6fde6678c3e2df37a2c08debcb8b34ba2f3fb945c52c5af85313dfff92a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/bundle.json","state_url":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/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-05-30T11:12:32Z","links":{"resolver":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z","bundle":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/bundle.json","state":"https://pith.science/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRQED4BVZL4ZY6LW4P2VVGTZ7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WRQED4BVZL4ZY6LW4P2VVGTZ7Z","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":"0e5b49c5641447add82ece2773159ba29f224c90a714f74b6f21689e069d588d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-04T18:02:51Z","title_canon_sha256":"e0b42cd2e160c41d6b12fad76f558ff0c57034f3e783ded327fb04f35b6a30dd"},"schema_version":"1.0","source":{"id":"1505.00734","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00734","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00734v2","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00734","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"WRQED4BVZL4Z","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WRQED4BVZL4ZY6LW","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WRQED4BV","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:d36fd6fde6678c3e2df37a2c08debcb8b34ba2f3fb945c52c5af85313dfff92a","target":"graph","created_at":"2026-05-18T01:09:55Z","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 discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph $G\\sim {\\mathcal G}(n,p)$ in order to find a subgraph which possesses some target property with high probability. In this paper we focus on finding long paths in $G\\sim \\mathcal G(n,p)$ when $p=\\frac{1+\\varepsilon}{n}$ for some fixed constant $\\varepsilon>0$. This random graph is known to have typically linearly long paths.\n  To have $\\ell$ edges with high probability in $G\\sim \\mathcal G(n,p)$ one clearly needs to query","authors_text":"Asaf Ferber, Benny Sudakov, Michael Krivelevich, Pedro Vieira","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-04T18:02:51Z","title":"Finding paths in sparse random graphs requires many queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00734","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:0c09b6bbe4321c83635bc13dbcb2c55bd0f4415b958ef7bcbf8ae72b7fc2ca3c","target":"record","created_at":"2026-05-18T01:09:55Z","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":"0e5b49c5641447add82ece2773159ba29f224c90a714f74b6f21689e069d588d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-04T18:02:51Z","title_canon_sha256":"e0b42cd2e160c41d6b12fad76f558ff0c57034f3e783ded327fb04f35b6a30dd"},"schema_version":"1.0","source":{"id":"1505.00734","kind":"arxiv","version":2}},"canonical_sha256":"b46041f035caf99c7976e3f55a9a79fe613847abd3d9d9c01add81cfcbf6a068","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b46041f035caf99c7976e3f55a9a79fe613847abd3d9d9c01add81cfcbf6a068","first_computed_at":"2026-05-18T01:09:55.336309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:55.336309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qc92q+FDzSfdbMeZO1ACu+bus24mYU4+JsNLu4tOTzDu/C/9KXkjCRoNRIMpyKQbnIWvgefGGkb53NWvZkmhDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:55.338469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00734","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c09b6bbe4321c83635bc13dbcb2c55bd0f4415b958ef7bcbf8ae72b7fc2ca3c","sha256:d36fd6fde6678c3e2df37a2c08debcb8b34ba2f3fb945c52c5af85313dfff92a"],"state_sha256":"e2cb987366ec149e7e924a0e64c8ba99a53f1ae1802621314808186d72bbc45d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hZ7IWFdE7n6N+5/h8K/QUMwsRb5dz2qtMJYjlUpjm08D+bJc87TsxFteit00IU74I+8F1GwabfunFFBzg8q0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:12:32.814349Z","bundle_sha256":"82d55218d5817032167e9ca4b5a5999d6f31c374e0c8fbc1a09c4afd0faef8c5"}}