{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:WY52B25FFT3GIPXADYQSCX3QWB","short_pith_number":"pith:WY52B25F","canonical_record":{"source":{"id":"2106.11130","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-06-21T14:09:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b7c43168eabaf4bf9cc791f04df7e1bffce627f1f82e727e2a5e1dde4dcb01e7","abstract_canon_sha256":"e543917b5b4e18c7f20f360283a6e0fdb7b238b82e6d495e610720188814b37d"},"schema_version":"1.0"},"canonical_sha256":"b63ba0eba52cf6643ee01e21215f70b065c0b0ff47bce9e12dc3066813da5cae","source":{"kind":"arxiv","id":"2106.11130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.11130","created_at":"2026-07-05T02:50:56Z"},{"alias_kind":"arxiv_version","alias_value":"2106.11130v1","created_at":"2026-07-05T02:50:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.11130","created_at":"2026-07-05T02:50:56Z"},{"alias_kind":"pith_short_12","alias_value":"WY52B25FFT3G","created_at":"2026-07-05T02:50:56Z"},{"alias_kind":"pith_short_16","alias_value":"WY52B25FFT3GIPXA","created_at":"2026-07-05T02:50:56Z"},{"alias_kind":"pith_short_8","alias_value":"WY52B25F","created_at":"2026-07-05T02:50:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:WY52B25FFT3GIPXADYQSCX3QWB","target":"record","payload":{"canonical_record":{"source":{"id":"2106.11130","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-06-21T14:09:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b7c43168eabaf4bf9cc791f04df7e1bffce627f1f82e727e2a5e1dde4dcb01e7","abstract_canon_sha256":"e543917b5b4e18c7f20f360283a6e0fdb7b238b82e6d495e610720188814b37d"},"schema_version":"1.0"},"canonical_sha256":"b63ba0eba52cf6643ee01e21215f70b065c0b0ff47bce9e12dc3066813da5cae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:50:56.981894Z","signature_b64":"vq5U9zm29skPu5e3zwrXfbbO9Zwybzi/NgYIVVPw1Oo00DKRySwS6AdKkWoZ6qoMsFecCQ24MOy4wOrciWpvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b63ba0eba52cf6643ee01e21215f70b065c0b0ff47bce9e12dc3066813da5cae","last_reissued_at":"2026-07-05T02:50:56.981505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:50:56.981505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.11130","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-05T02:50:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NP6lLttEOEmXw2h7OLcMFr1acxugXYCzBtVsAwGr1BvdDFWeJRmFgQvGvSldZwl4RpGeGfWGvbw7IyKRnVxVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T02:05:04.711329Z"},"content_sha256":"e185d5f38dfbb0eb6fc262094ee591f4bffce2f8fdab9155c4a27c6cb742bb57","schema_version":"1.0","event_id":"sha256:e185d5f38dfbb0eb6fc262094ee591f4bffce2f8fdab9155c4a27c6cb742bb57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:WY52B25FFT3GIPXADYQSCX3QWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Long induced paths in a configuration model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Gabriel Faraud, Laurent M\\'enard, Nathana\\\"el Enriquez, Nathan Noiry","submitted_at":"2021-06-21T14:09:30Z","abstract_excerpt":"In an article published in 1987 in Combinatorica \\cite{MR918397}, Frieze and Jackson established a lower bound on the length of the longest induced path (and cycle) in a sparse random graph. Their bound is obtained through a rough analysis of a greedy algorithm. In the present work, we provide a sharp asymptotic for the length of the induced path constructed by their algorithm. To this end, we introduce an alternative algorithm that builds the same induced path and whose analysis falls into the framework of a previous work by the authors on depth-first exploration of a configuration model \\cit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.11130","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/2106.11130/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-05T02:50:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mm0WmAQYWwWwjj7f87/9MarES0Vgo9sTG9G/L7kLLAJKn09BuHS8UNRx8+lqU3qPHbhRQjbPi74f/UR4B2pPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T02:05:04.711828Z"},"content_sha256":"b714e5e22efb982e0b677ae656a0f66a9f391cfba2622f8d42fdad23f0876d91","schema_version":"1.0","event_id":"sha256:b714e5e22efb982e0b677ae656a0f66a9f391cfba2622f8d42fdad23f0876d91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WY52B25FFT3GIPXADYQSCX3QWB/bundle.json","state_url":"https://pith.science/pith/WY52B25FFT3GIPXADYQSCX3QWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WY52B25FFT3GIPXADYQSCX3QWB/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-08-10T02:05:04Z","links":{"resolver":"https://pith.science/pith/WY52B25FFT3GIPXADYQSCX3QWB","bundle":"https://pith.science/pith/WY52B25FFT3GIPXADYQSCX3QWB/bundle.json","state":"https://pith.science/pith/WY52B25FFT3GIPXADYQSCX3QWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WY52B25FFT3GIPXADYQSCX3QWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:WY52B25FFT3GIPXADYQSCX3QWB","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":"e543917b5b4e18c7f20f360283a6e0fdb7b238b82e6d495e610720188814b37d","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-06-21T14:09:30Z","title_canon_sha256":"b7c43168eabaf4bf9cc791f04df7e1bffce627f1f82e727e2a5e1dde4dcb01e7"},"schema_version":"1.0","source":{"id":"2106.11130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.11130","created_at":"2026-07-05T02:50:56Z"},{"alias_kind":"arxiv_version","alias_value":"2106.11130v1","created_at":"2026-07-05T02:50:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.11130","created_at":"2026-07-05T02:50:56Z"},{"alias_kind":"pith_short_12","alias_value":"WY52B25FFT3G","created_at":"2026-07-05T02:50:56Z"},{"alias_kind":"pith_short_16","alias_value":"WY52B25FFT3GIPXA","created_at":"2026-07-05T02:50:56Z"},{"alias_kind":"pith_short_8","alias_value":"WY52B25F","created_at":"2026-07-05T02:50:56Z"}],"graph_snapshots":[{"event_id":"sha256:b714e5e22efb982e0b677ae656a0f66a9f391cfba2622f8d42fdad23f0876d91","target":"graph","created_at":"2026-07-05T02:50:56Z","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/2106.11130/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In an article published in 1987 in Combinatorica \\cite{MR918397}, Frieze and Jackson established a lower bound on the length of the longest induced path (and cycle) in a sparse random graph. Their bound is obtained through a rough analysis of a greedy algorithm. In the present work, we provide a sharp asymptotic for the length of the induced path constructed by their algorithm. To this end, we introduce an alternative algorithm that builds the same induced path and whose analysis falls into the framework of a previous work by the authors on depth-first exploration of a configuration model \\cit","authors_text":"Gabriel Faraud, Laurent M\\'enard, Nathana\\\"el Enriquez, Nathan Noiry","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-06-21T14:09:30Z","title":"Long induced paths in a configuration model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.11130","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:e185d5f38dfbb0eb6fc262094ee591f4bffce2f8fdab9155c4a27c6cb742bb57","target":"record","created_at":"2026-07-05T02:50:56Z","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":"e543917b5b4e18c7f20f360283a6e0fdb7b238b82e6d495e610720188814b37d","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-06-21T14:09:30Z","title_canon_sha256":"b7c43168eabaf4bf9cc791f04df7e1bffce627f1f82e727e2a5e1dde4dcb01e7"},"schema_version":"1.0","source":{"id":"2106.11130","kind":"arxiv","version":1}},"canonical_sha256":"b63ba0eba52cf6643ee01e21215f70b065c0b0ff47bce9e12dc3066813da5cae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b63ba0eba52cf6643ee01e21215f70b065c0b0ff47bce9e12dc3066813da5cae","first_computed_at":"2026-07-05T02:50:56.981505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:50:56.981505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vq5U9zm29skPu5e3zwrXfbbO9Zwybzi/NgYIVVPw1Oo00DKRySwS6AdKkWoZ6qoMsFecCQ24MOy4wOrciWpvCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:50:56.981894Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.11130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e185d5f38dfbb0eb6fc262094ee591f4bffce2f8fdab9155c4a27c6cb742bb57","sha256:b714e5e22efb982e0b677ae656a0f66a9f391cfba2622f8d42fdad23f0876d91"],"state_sha256":"02e1851a595fca85d66e312ae2208afd4264c49c6635f723fd12a658839ec52a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2h4PHpVjysnuKX6Jf6nic9OOVZwc+P23TL5TLuGfRO/6JkBYkKDe7hRbEoIcKHYG+Kcd2siec59K24am9vmDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T02:05:04.715224Z","bundle_sha256":"1bfbc3873d4eb400b5da89d24bd55bd667c228a5378086841a69c47a391d752f"}}