{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MPCVN5E5FUXAXGQ4EYZJ3V6F3O","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":"295940f0bd668ba2aba299c82ed97150ee123a0a5ebe98ab93fb23ab67204aea","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-10T16:26:08Z","title_canon_sha256":"61c8d9d82957d3e9f2ccc3a9f70c365f72a8b2dd41376536346d6f9034addfec"},"schema_version":"1.0","source":{"id":"2404.07147","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.07147","created_at":"2026-07-05T08:06:35Z"},{"alias_kind":"arxiv_version","alias_value":"2404.07147v1","created_at":"2026-07-05T08:06:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07147","created_at":"2026-07-05T08:06:35Z"},{"alias_kind":"pith_short_12","alias_value":"MPCVN5E5FUXA","created_at":"2026-07-05T08:06:35Z"},{"alias_kind":"pith_short_16","alias_value":"MPCVN5E5FUXAXGQ4","created_at":"2026-07-05T08:06:35Z"},{"alias_kind":"pith_short_8","alias_value":"MPCVN5E5","created_at":"2026-07-05T08:06:35Z"}],"graph_snapshots":[{"event_id":"sha256:6f87b1fab49e11e3995051dcadc245ed9c07a4e1d5517a730b1711b4fb137813","target":"graph","created_at":"2026-07-05T08:06:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.07147/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider random simple temporal graphs in which every edge of the complete graph $K_n$ appears once within the time interval [0,1] independently and uniformly at random. Our main result is a sharp threshold on the size of any maximum $\\delta$-clique (namely a clique with edges appearing at most $\\delta$ apart within [0,1]) in random instances of this model, for any constant~$\\delta$. In particular, using the probabilistic method, we prove that the size of a maximum $\\delta$-clique is approximately $\\frac{2\\log{n}}{\\log{\\frac{1}{\\delta}}}$ with high probability (whp). What seems surprising i","authors_text":"Christoforos Raptopoulos, George B. Mertzios, Paul G. Spirakis, Sotiris Nikoletseas","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-10T16:26:08Z","title":"On the existence of $\\delta$-temporal cliques in random simple temporal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07147","kind":"arxiv","version":1},"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:4a71660070123f43e91f37a475b8d9e537562512389ade56a1595abdb9a313d8","target":"record","created_at":"2026-07-05T08:06:35Z","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":"295940f0bd668ba2aba299c82ed97150ee123a0a5ebe98ab93fb23ab67204aea","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-10T16:26:08Z","title_canon_sha256":"61c8d9d82957d3e9f2ccc3a9f70c365f72a8b2dd41376536346d6f9034addfec"},"schema_version":"1.0","source":{"id":"2404.07147","kind":"arxiv","version":1}},"canonical_sha256":"63c556f49d2d2e0b9a1c26329dd7c5dbb3d2f3f0cc75e90b2db7a6261d0c29b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63c556f49d2d2e0b9a1c26329dd7c5dbb3d2f3f0cc75e90b2db7a6261d0c29b8","first_computed_at":"2026-07-05T08:06:35.953941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:06:35.953941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9zp+hOYUqlqzW2q1x5kROwg6MaRcbA6Cs5Kl3G+xadjgTcPuHk0LlwQNL5KybztMm2cr60Ec3s2wIaLpSA4qBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:06:35.954430Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.07147","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a71660070123f43e91f37a475b8d9e537562512389ade56a1595abdb9a313d8","sha256:6f87b1fab49e11e3995051dcadc245ed9c07a4e1d5517a730b1711b4fb137813"],"state_sha256":"a8d3cbb415fe41025e454fdc7164110cc45d34c7226ec9b35e99409efe88a070"}