{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GIBCJMZLTVIRIMVK4CITSHOBUE","short_pith_number":"pith:GIBCJMZL","canonical_record":{"source":{"id":"1811.01800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-11-05T15:37:31Z","cross_cats_sorted":[],"title_canon_sha256":"e0e9da89d7d0f19a45416ed88672057bff80dae27d8a9dda79ec92d55c202846","abstract_canon_sha256":"7fddf68522dcf6e15984bc0cc6463f9a82cd404f93e160d4d6ae197415c003ff"},"schema_version":"1.0"},"canonical_sha256":"320224b32b9d511432aae091391dc1a11e7eab7568e7db2dc6c80011de305451","source":{"kind":"arxiv","id":"1811.01800","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01800","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01800v2","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01800","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"GIBCJMZLTVIR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GIBCJMZLTVIRIMVK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GIBCJMZL","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GIBCJMZLTVIRIMVK4CITSHOBUE","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-11-05T15:37:31Z","cross_cats_sorted":[],"title_canon_sha256":"e0e9da89d7d0f19a45416ed88672057bff80dae27d8a9dda79ec92d55c202846","abstract_canon_sha256":"7fddf68522dcf6e15984bc0cc6463f9a82cd404f93e160d4d6ae197415c003ff"},"schema_version":"1.0"},"canonical_sha256":"320224b32b9d511432aae091391dc1a11e7eab7568e7db2dc6c80011de305451","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:15.333287Z","signature_b64":"1F5z92p9FW2A5YebQSKFr0WrqOv897EtgKlVjuaErLI5OBxCwbyotambGj5DXfqMk0+w35xWsDiLE7abbE23Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"320224b32b9d511432aae091391dc1a11e7eab7568e7db2dc6c80011de305451","last_reissued_at":"2026-05-17T23:42:15.332658Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:15.332658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01800","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-17T23:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pqR6+WzqnO+oTDSsYol5nLgpGLETulxwORyt9hn+pJNRIBvf/C6UP++kY6ulQCDRmbnRgqqvySkjv43ib+leCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:21:12.740267Z"},"content_sha256":"0a0299a859ab991baf4a590d3c2f420d053fc69759fc22d097a0c6f3404fa82c","schema_version":"1.0","event_id":"sha256:0a0299a859ab991baf4a590d3c2f420d053fc69759fc22d097a0c6f3404fa82c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GIBCJMZLTVIRIMVK4CITSHOBUE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Planting trees in graphs, and finding them back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Don Towsley, Laurent Massouli\\'e, Ludovic Stephan","submitted_at":"2018-11-05T15:37:31Z","abstract_excerpt":"In this paper we study detection and reconstruction of planted structures in Erd\\H{o}s-R\\'enyi random graphs. Motivated by a problem of communication security, we focus on planted structures that consist in a tree graph. For planted line graphs, we establish the following phase diagram. In a low density region where the average degree $\\lambda$ of the initial graph is below some critical value $\\lambda_c=1$, detection and reconstruction go from impossible to easy as the line length $K$ crosses some critical value $f(\\lambda)\\ln(n)$, where $n$ is the number of nodes in the graph. In the high de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01800","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-17T23:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/i6wwkZ62SfmVe8VXtkvp6jQ+xiZUEh6JrD0P+5POFat9ySYZiSqX/dGvYmQv6wwWRiJ6Hpn8322xzB7gjyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:21:12.740930Z"},"content_sha256":"a00c602314f20d14244e4f0ee593700db0b832f77ca6a23a42544784f881c844","schema_version":"1.0","event_id":"sha256:a00c602314f20d14244e4f0ee593700db0b832f77ca6a23a42544784f881c844"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE/bundle.json","state_url":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIBCJMZLTVIRIMVK4CITSHOBUE/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-28T17:21:12Z","links":{"resolver":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE","bundle":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE/bundle.json","state":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIBCJMZLTVIRIMVK4CITSHOBUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GIBCJMZLTVIRIMVK4CITSHOBUE","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":"7fddf68522dcf6e15984bc0cc6463f9a82cd404f93e160d4d6ae197415c003ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-11-05T15:37:31Z","title_canon_sha256":"e0e9da89d7d0f19a45416ed88672057bff80dae27d8a9dda79ec92d55c202846"},"schema_version":"1.0","source":{"id":"1811.01800","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01800","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01800v2","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01800","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"GIBCJMZLTVIR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GIBCJMZLTVIRIMVK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GIBCJMZL","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:a00c602314f20d14244e4f0ee593700db0b832f77ca6a23a42544784f881c844","target":"graph","created_at":"2026-05-17T23:42:15Z","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":"In this paper we study detection and reconstruction of planted structures in Erd\\H{o}s-R\\'enyi random graphs. Motivated by a problem of communication security, we focus on planted structures that consist in a tree graph. For planted line graphs, we establish the following phase diagram. In a low density region where the average degree $\\lambda$ of the initial graph is below some critical value $\\lambda_c=1$, detection and reconstruction go from impossible to easy as the line length $K$ crosses some critical value $f(\\lambda)\\ln(n)$, where $n$ is the number of nodes in the graph. In the high de","authors_text":"Don Towsley, Laurent Massouli\\'e, Ludovic Stephan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-11-05T15:37:31Z","title":"Planting trees in graphs, and finding them back"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01800","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:0a0299a859ab991baf4a590d3c2f420d053fc69759fc22d097a0c6f3404fa82c","target":"record","created_at":"2026-05-17T23:42:15Z","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":"7fddf68522dcf6e15984bc0cc6463f9a82cd404f93e160d4d6ae197415c003ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-11-05T15:37:31Z","title_canon_sha256":"e0e9da89d7d0f19a45416ed88672057bff80dae27d8a9dda79ec92d55c202846"},"schema_version":"1.0","source":{"id":"1811.01800","kind":"arxiv","version":2}},"canonical_sha256":"320224b32b9d511432aae091391dc1a11e7eab7568e7db2dc6c80011de305451","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"320224b32b9d511432aae091391dc1a11e7eab7568e7db2dc6c80011de305451","first_computed_at":"2026-05-17T23:42:15.332658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:15.332658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1F5z92p9FW2A5YebQSKFr0WrqOv897EtgKlVjuaErLI5OBxCwbyotambGj5DXfqMk0+w35xWsDiLE7abbE23Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:15.333287Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01800","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a0299a859ab991baf4a590d3c2f420d053fc69759fc22d097a0c6f3404fa82c","sha256:a00c602314f20d14244e4f0ee593700db0b832f77ca6a23a42544784f881c844"],"state_sha256":"c1524baa03bec6d60b450b9c50bbd98dcc480d47cec4aedda0630181453a48f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHXE6ZEjOFwBq8ygSeDwjHRsv19TWIhoDk2aFXH0pIqhB6KSa8reW1wEtBj0k3YqCktsj9QNN5fPM8a1XOX0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:21:12.744194Z","bundle_sha256":"81a8667e1f8a4da08be85af287ae76753de9f44140aa5f903e98739c6874b2bf"}}