{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QBR5EAVANE3AMYVJ6XF2NQ34QP","short_pith_number":"pith:QBR5EAVA","canonical_record":{"source":{"id":"1101.5547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-01-28T15:12:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b4f1fed39e2d4540b386e67d1eb3f6d037920f5f1636d0b96e145311a5da4448","abstract_canon_sha256":"be2952a5810e1d30a77372ef9abd097c6a0548009bff71e76208df3b67940a6d"},"schema_version":"1.0"},"canonical_sha256":"8063d202a069360662a9f5cba6c37c83d404242fa167a93818c118786ad8f6a6","source":{"kind":"arxiv","id":"1101.5547","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5547","created_at":"2026-05-18T03:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5547v2","created_at":"2026-05-18T03:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5547","created_at":"2026-05-18T03:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"QBR5EAVANE3A","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QBR5EAVANE3AMYVJ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QBR5EAVA","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QBR5EAVANE3AMYVJ6XF2NQ34QP","target":"record","payload":{"canonical_record":{"source":{"id":"1101.5547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-01-28T15:12:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b4f1fed39e2d4540b386e67d1eb3f6d037920f5f1636d0b96e145311a5da4448","abstract_canon_sha256":"be2952a5810e1d30a77372ef9abd097c6a0548009bff71e76208df3b67940a6d"},"schema_version":"1.0"},"canonical_sha256":"8063d202a069360662a9f5cba6c37c83d404242fa167a93818c118786ad8f6a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:12.847379Z","signature_b64":"i9dW2DKgBKkGzhePk+TDYt8HARq0f9HnWqv2v8KMXhFAanlcnGpd7eG1BpM7+PktXu1t6x8agA/YgUjcpnFyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8063d202a069360662a9f5cba6c37c83d404242fa167a93818c118786ad8f6a6","last_reissued_at":"2026-05-18T03:41:12.846506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:12.846506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.5547","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-18T03:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SE2zQJBdTy4ZjynUQTZKFaUtUtOsve0PbHYSYZtYwA6OUZ06ZTgKNZusVcSdaDuNLmyLbF11gMwFZRQPManUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T03:20:24.117213Z"},"content_sha256":"c2c58d67d93b8579280fe462206ec016657b9fe4f5be979c99a616d445c68933","schema_version":"1.0","event_id":"sha256:c2c58d67d93b8579280fe462206ec016657b9fe4f5be979c99a616d445c68933"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QBR5EAVANE3AMYVJ6XF2NQ34QP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Longest path distance in random circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Nicolas Broutin, Omar Fawzi","submitted_at":"2011-01-28T15:12:19Z","abstract_excerpt":"We study distance properties of a general class of random directed acyclic graphs (DAGs). In a DAG, many natural notions of distance are possible, for there exists multiple paths between pairs of nodes. The distance of interest for circuits is the maximum length of a path between two nodes. We give laws of large numbers for the typical depth (distance to the root) and the minimum depth in a random DAG. This completes the study of natural distances in random DAGs initiated (in the uniform case) by Devroye and Janson (2009+). We also obtain large deviation bounds for the minimum of a branching r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5547","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-18T03:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gyU7X4PB3Rx1wGmN5jDXPUAwP+NOTL53csa2f7OOns/L80cXwOCdOVlk+IQX6s7OO4J0iIFEtNpPTMI6leZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T03:20:24.117902Z"},"content_sha256":"ab1e4643d1de92b3310e382516759b02c980c5c50f553ac2349b3ad0593f902a","schema_version":"1.0","event_id":"sha256:ab1e4643d1de92b3310e382516759b02c980c5c50f553ac2349b3ad0593f902a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBR5EAVANE3AMYVJ6XF2NQ34QP/bundle.json","state_url":"https://pith.science/pith/QBR5EAVANE3AMYVJ6XF2NQ34QP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBR5EAVANE3AMYVJ6XF2NQ34QP/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-23T03:20:24Z","links":{"resolver":"https://pith.science/pith/QBR5EAVANE3AMYVJ6XF2NQ34QP","bundle":"https://pith.science/pith/QBR5EAVANE3AMYVJ6XF2NQ34QP/bundle.json","state":"https://pith.science/pith/QBR5EAVANE3AMYVJ6XF2NQ34QP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBR5EAVANE3AMYVJ6XF2NQ34QP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QBR5EAVANE3AMYVJ6XF2NQ34QP","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":"be2952a5810e1d30a77372ef9abd097c6a0548009bff71e76208df3b67940a6d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-01-28T15:12:19Z","title_canon_sha256":"b4f1fed39e2d4540b386e67d1eb3f6d037920f5f1636d0b96e145311a5da4448"},"schema_version":"1.0","source":{"id":"1101.5547","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5547","created_at":"2026-05-18T03:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5547v2","created_at":"2026-05-18T03:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5547","created_at":"2026-05-18T03:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"QBR5EAVANE3A","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QBR5EAVANE3AMYVJ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QBR5EAVA","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:ab1e4643d1de92b3310e382516759b02c980c5c50f553ac2349b3ad0593f902a","target":"graph","created_at":"2026-05-18T03:41:12Z","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 study distance properties of a general class of random directed acyclic graphs (DAGs). In a DAG, many natural notions of distance are possible, for there exists multiple paths between pairs of nodes. The distance of interest for circuits is the maximum length of a path between two nodes. We give laws of large numbers for the typical depth (distance to the root) and the minimum depth in a random DAG. This completes the study of natural distances in random DAGs initiated (in the uniform case) by Devroye and Janson (2009+). We also obtain large deviation bounds for the minimum of a branching r","authors_text":"Nicolas Broutin, Omar Fawzi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-01-28T15:12:19Z","title":"Longest path distance in random circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5547","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:c2c58d67d93b8579280fe462206ec016657b9fe4f5be979c99a616d445c68933","target":"record","created_at":"2026-05-18T03:41:12Z","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":"be2952a5810e1d30a77372ef9abd097c6a0548009bff71e76208df3b67940a6d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-01-28T15:12:19Z","title_canon_sha256":"b4f1fed39e2d4540b386e67d1eb3f6d037920f5f1636d0b96e145311a5da4448"},"schema_version":"1.0","source":{"id":"1101.5547","kind":"arxiv","version":2}},"canonical_sha256":"8063d202a069360662a9f5cba6c37c83d404242fa167a93818c118786ad8f6a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8063d202a069360662a9f5cba6c37c83d404242fa167a93818c118786ad8f6a6","first_computed_at":"2026-05-18T03:41:12.846506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:12.846506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i9dW2DKgBKkGzhePk+TDYt8HARq0f9HnWqv2v8KMXhFAanlcnGpd7eG1BpM7+PktXu1t6x8agA/YgUjcpnFyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:12.847379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.5547","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2c58d67d93b8579280fe462206ec016657b9fe4f5be979c99a616d445c68933","sha256:ab1e4643d1de92b3310e382516759b02c980c5c50f553ac2349b3ad0593f902a"],"state_sha256":"8a31f26abb1f6a9922a52116e226759690597193f3f22731e057570d394d9d96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZcQU+CMRcbd+vkfeB7KJx16J+DsDmQSvVLLQWTwkBFQ4XvUFgMnjfrQd3DBohocZT3K9XHWQjXvyBEcVTsFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T03:20:24.121681Z","bundle_sha256":"2433e0973fa97f8a6744be0936be44615c5e90284dc6182af6c221f5db61884a"}}