{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SSROQF7Z6BP7D2JFHDWO4SLRQE","short_pith_number":"pith:SSROQF7Z","schema_version":"1.0","canonical_sha256":"94a2e817f9f05ff1e92538ecee49718124c74381a2f34f8578423e4c1c68629a","source":{"kind":"arxiv","id":"1907.12043","version":1},"attestation_state":"computed","paper":{"title":"Thresholds in random motif graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Anastos, Peleg Michaeli, Samantha Petti","submitted_at":"2019-07-28T08:20:48Z","abstract_excerpt":"We introduce a natural generalization of the Erd\\H{o}s-R\\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding an instance of a fixed graph $H$ on each of the copies of $H$ in the complete graph on $n$ vertices, independently with probability $p$. We establish that every monotone property has a threshold in this model, and determine the thresholds for connectivity, Hamiltonicity, the existence of a perfect matching, and subgraph appearance. Moreover, in the first thre"},"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":"1907.12043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-28T08:20:48Z","cross_cats_sorted":[],"title_canon_sha256":"5091541b904a09440bbe995cb79f0bc32b2f3eae1005b305bdfc8fcbc63cea1d","abstract_canon_sha256":"3f06c1860ad279ce3e6c07d725391a023e14f1221a537f54ae4670b18d96eaf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:50:04.865923Z","signature_b64":"1RNzvFKgq0Ljat24Hc7sel6Xug0b2rkqwAszNFvJlH8A6eOYbAJ93BG5xPXYkY+1ZyXGaQZicPxEgjZ/B5woBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94a2e817f9f05ff1e92538ecee49718124c74381a2f34f8578423e4c1c68629a","last_reissued_at":"2026-07-04T23:50:04.865486Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:50:04.865486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thresholds in random motif graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Anastos, Peleg Michaeli, Samantha Petti","submitted_at":"2019-07-28T08:20:48Z","abstract_excerpt":"We introduce a natural generalization of the Erd\\H{o}s-R\\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding an instance of a fixed graph $H$ on each of the copies of $H$ in the complete graph on $n$ vertices, independently with probability $p$. We establish that every monotone property has a threshold in this model, and determine the thresholds for connectivity, Hamiltonicity, the existence of a perfect matching, and subgraph appearance. Moreover, in the first thre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.12043","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/1907.12043/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.12043","created_at":"2026-07-04T23:50:04.865537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.12043v1","created_at":"2026-07-04T23:50:04.865537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12043","created_at":"2026-07-04T23:50:04.865537+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSROQF7Z6BP7","created_at":"2026-07-04T23:50:04.865537+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSROQF7Z6BP7D2JF","created_at":"2026-07-04T23:50:04.865537+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSROQF7Z","created_at":"2026-07-04T23:50:04.865537+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSROQF7Z6BP7D2JFHDWO4SLRQE","json":"https://pith.science/pith/SSROQF7Z6BP7D2JFHDWO4SLRQE.json","graph_json":"https://pith.science/api/pith-number/SSROQF7Z6BP7D2JFHDWO4SLRQE/graph.json","events_json":"https://pith.science/api/pith-number/SSROQF7Z6BP7D2JFHDWO4SLRQE/events.json","paper":"https://pith.science/paper/SSROQF7Z"},"agent_actions":{"view_html":"https://pith.science/pith/SSROQF7Z6BP7D2JFHDWO4SLRQE","download_json":"https://pith.science/pith/SSROQF7Z6BP7D2JFHDWO4SLRQE.json","view_paper":"https://pith.science/paper/SSROQF7Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.12043&json=true","fetch_graph":"https://pith.science/api/pith-number/SSROQF7Z6BP7D2JFHDWO4SLRQE/graph.json","fetch_events":"https://pith.science/api/pith-number/SSROQF7Z6BP7D2JFHDWO4SLRQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSROQF7Z6BP7D2JFHDWO4SLRQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSROQF7Z6BP7D2JFHDWO4SLRQE/action/storage_attestation","attest_author":"https://pith.science/pith/SSROQF7Z6BP7D2JFHDWO4SLRQE/action/author_attestation","sign_citation":"https://pith.science/pith/SSROQF7Z6BP7D2JFHDWO4SLRQE/action/citation_signature","submit_replication":"https://pith.science/pith/SSROQF7Z6BP7D2JFHDWO4SLRQE/action/replication_record"}},"created_at":"2026-07-04T23:50:04.865537+00:00","updated_at":"2026-07-04T23:50:04.865537+00:00"}