{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GIBCJMZLTVIRIMVK4CITSHOBUE","short_pith_number":"pith:GIBCJMZL","schema_version":"1.0","canonical_sha256":"320224b32b9d511432aae091391dc1a11e7eab7568e7db2dc6c80011de305451","source":{"kind":"arxiv","id":"1811.01800","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.01800","created_at":"2026-05-17T23:42:15.332751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01800v2","created_at":"2026-05-17T23:42:15.332751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01800","created_at":"2026-05-17T23:42:15.332751+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIBCJMZLTVIR","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIBCJMZLTVIRIMVK","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIBCJMZL","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.11636","citing_title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE","json":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE.json","graph_json":"https://pith.science/api/pith-number/GIBCJMZLTVIRIMVK4CITSHOBUE/graph.json","events_json":"https://pith.science/api/pith-number/GIBCJMZLTVIRIMVK4CITSHOBUE/events.json","paper":"https://pith.science/paper/GIBCJMZL"},"agent_actions":{"view_html":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE","download_json":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE.json","view_paper":"https://pith.science/paper/GIBCJMZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01800&json=true","fetch_graph":"https://pith.science/api/pith-number/GIBCJMZLTVIRIMVK4CITSHOBUE/graph.json","fetch_events":"https://pith.science/api/pith-number/GIBCJMZLTVIRIMVK4CITSHOBUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE/action/storage_attestation","attest_author":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE/action/author_attestation","sign_citation":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE/action/citation_signature","submit_replication":"https://pith.science/pith/GIBCJMZLTVIRIMVK4CITSHOBUE/action/replication_record"}},"created_at":"2026-05-17T23:42:15.332751+00:00","updated_at":"2026-05-17T23:42:15.332751+00:00"}