{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RGVNB3KGX27RL5Q63MROBMWGGM","short_pith_number":"pith:RGVNB3KG","schema_version":"1.0","canonical_sha256":"89aad0ed46bebf15f61edb22e0b2c633159ca186cc424be945c2b09af0862a48","source":{"kind":"arxiv","id":"2602.01847","version":3},"attestation_state":"computed","paper":{"title":"Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DM","authors_text":"George B. Mertzios, Henry Austin, Paul G. Spirakis","submitted_at":"2026-02-02T09:19:55Z","abstract_excerpt":"In this paper we study two natural models of random temporal graphs. In the first, the continuous model, each edge $e$ is assigned $l_e$ labels, each drawn uniformly at random from $(0,1]$, where the numbers $l_e$ are independent random variables following the same discrete probability distribution. In the second, the discrete model, the $l_e$ labels of each edge $e$ are chosen uniformly at random from a set $\\{1,2,\\ldots,T\\}$. In both models we study the existence of $\\delta$-temporal motifs. Here a $\\delta$-temporal motif consists of a pair $(H,P)$, where $H$ is a fixed static graph and $P$ "},"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":"2602.01847","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-02-02T09:19:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"01e94dc2262a9d2a095a0fa686af75c3c2a86e21517d15edf7c3964352b5ba43","abstract_canon_sha256":"f28800d2f600dfa26c5b20343ac48577eae620d5d981266f3afb25dafc28ddf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:28.496135Z","signature_b64":"SzRyQebIHHuPZf/Fv5CHojYZ2aJOWOhnr1QrnLbTmoZ/PRiuvo6NLTbuUIRmY95gKm1IO37iZhWDfPEU9MLXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89aad0ed46bebf15f61edb22e0b2c633159ca186cc424be945c2b09af0862a48","last_reissued_at":"2026-06-29T01:14:28.495731Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:28.495731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DM","authors_text":"George B. Mertzios, Henry Austin, Paul G. Spirakis","submitted_at":"2026-02-02T09:19:55Z","abstract_excerpt":"In this paper we study two natural models of random temporal graphs. In the first, the continuous model, each edge $e$ is assigned $l_e$ labels, each drawn uniformly at random from $(0,1]$, where the numbers $l_e$ are independent random variables following the same discrete probability distribution. In the second, the discrete model, the $l_e$ labels of each edge $e$ are chosen uniformly at random from a set $\\{1,2,\\ldots,T\\}$. In both models we study the existence of $\\delta$-temporal motifs. Here a $\\delta$-temporal motif consists of a pair $(H,P)$, where $H$ is a fixed static graph and $P$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.01847","kind":"arxiv","version":3},"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/2602.01847/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":"2602.01847","created_at":"2026-06-29T01:14:28.495782+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.01847v3","created_at":"2026-06-29T01:14:28.495782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.01847","created_at":"2026-06-29T01:14:28.495782+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGVNB3KGX27R","created_at":"2026-06-29T01:14:28.495782+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGVNB3KGX27RL5Q6","created_at":"2026-06-29T01:14:28.495782+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGVNB3KG","created_at":"2026-06-29T01:14:28.495782+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RGVNB3KGX27RL5Q63MROBMWGGM","json":"https://pith.science/pith/RGVNB3KGX27RL5Q63MROBMWGGM.json","graph_json":"https://pith.science/api/pith-number/RGVNB3KGX27RL5Q63MROBMWGGM/graph.json","events_json":"https://pith.science/api/pith-number/RGVNB3KGX27RL5Q63MROBMWGGM/events.json","paper":"https://pith.science/paper/RGVNB3KG"},"agent_actions":{"view_html":"https://pith.science/pith/RGVNB3KGX27RL5Q63MROBMWGGM","download_json":"https://pith.science/pith/RGVNB3KGX27RL5Q63MROBMWGGM.json","view_paper":"https://pith.science/paper/RGVNB3KG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.01847&json=true","fetch_graph":"https://pith.science/api/pith-number/RGVNB3KGX27RL5Q63MROBMWGGM/graph.json","fetch_events":"https://pith.science/api/pith-number/RGVNB3KGX27RL5Q63MROBMWGGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGVNB3KGX27RL5Q63MROBMWGGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGVNB3KGX27RL5Q63MROBMWGGM/action/storage_attestation","attest_author":"https://pith.science/pith/RGVNB3KGX27RL5Q63MROBMWGGM/action/author_attestation","sign_citation":"https://pith.science/pith/RGVNB3KGX27RL5Q63MROBMWGGM/action/citation_signature","submit_replication":"https://pith.science/pith/RGVNB3KGX27RL5Q63MROBMWGGM/action/replication_record"}},"created_at":"2026-06-29T01:14:28.495782+00:00","updated_at":"2026-06-29T01:14:28.495782+00:00"}