{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DTUTXZ6HYDYS6YTIIVW6YQLW7O","short_pith_number":"pith:DTUTXZ6H","canonical_record":{"source":{"id":"1404.2106","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-08T12:36:25Z","cross_cats_sorted":["cs.DM","math.AT"],"title_canon_sha256":"cbf5fca7da9d8ae11e23e3f55868b3cbf86ef427d536608302a21396d0d63ff6","abstract_canon_sha256":"22bdbfcbaa27472c5d742a81199afa12768e9d1ed708e5bc4b92ae76bcc9a5e6"},"schema_version":"1.0"},"canonical_sha256":"1ce93be7c7c0f12f6268456dec4176fb974d291d65079a4e6ffb48835db72d29","source":{"kind":"arxiv","id":"1404.2106","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2106","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2106v2","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2106","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"DTUTXZ6HYDYS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DTUTXZ6HYDYS6YTI","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DTUTXZ6H","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DTUTXZ6HYDYS6YTIIVW6YQLW7O","target":"record","payload":{"canonical_record":{"source":{"id":"1404.2106","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-08T12:36:25Z","cross_cats_sorted":["cs.DM","math.AT"],"title_canon_sha256":"cbf5fca7da9d8ae11e23e3f55868b3cbf86ef427d536608302a21396d0d63ff6","abstract_canon_sha256":"22bdbfcbaa27472c5d742a81199afa12768e9d1ed708e5bc4b92ae76bcc9a5e6"},"schema_version":"1.0"},"canonical_sha256":"1ce93be7c7c0f12f6268456dec4176fb974d291d65079a4e6ffb48835db72d29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:12.274826Z","signature_b64":"t+9U018/OmUCbAyA7y+LK92HYe7hhO0uuHqb2OpuGCVQcLojwhawwPGm66eMyNiL58zCAEbfChf5Rpv0WNa4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ce93be7c7c0f12f6268456dec4176fb974d291d65079a4e6ffb48835db72d29","last_reissued_at":"2026-05-18T02:17:12.274079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:12.274079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.2106","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-18T02:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6MUCpF5Da/zUhswKFxxHz06LumQK8yz+4UI1NOzYtsN2le6pv1hoji5lJDh2GiefHmtYPRpHSYCu8Q8UmBhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:51:06.403201Z"},"content_sha256":"b9f1ed2000753558412d3b6748b52f3074ebbc3111e8abedc90fa7b95e676963","schema_version":"1.0","event_id":"sha256:b9f1ed2000753558412d3b6748b52f3074ebbc3111e8abedc90fa7b95e676963"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DTUTXZ6HYDYS6YTIIVW6YQLW7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Topological Minors in Random Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.AT"],"primary_cat":"math.CO","authors_text":"Anna Gundert, Uli Wagner","submitted_at":"2014-04-08T12:36:25Z","abstract_excerpt":"For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the given graph, it is well-known that the (sharp) threshold is at $p=1/n$. We consider a natural analogue of this question for higher-dimensional random complexes $X^k(n,p)$, first studied by Cohen, Costa, Farber and Kappeler for $k=2$.\n  Improving previous results, we show that $p=\\Theta(1/\\sqrt{n})$ is the (coarse) threshold for containing a subdivision of an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2106","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-18T02:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOO0i38VmqqKA0/Igo/GyPYcBs2fnqsnZS/39nQvL11TFJWnrjxuC6CS1Fy3ZP7F+urS1EpF8zNZ4dGlpY2kCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:51:06.403560Z"},"content_sha256":"87825854db8e3b21338cc2802e0edd9f667e2060d981184ae982d8bc2c65d014","schema_version":"1.0","event_id":"sha256:87825854db8e3b21338cc2802e0edd9f667e2060d981184ae982d8bc2c65d014"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTUTXZ6HYDYS6YTIIVW6YQLW7O/bundle.json","state_url":"https://pith.science/pith/DTUTXZ6HYDYS6YTIIVW6YQLW7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTUTXZ6HYDYS6YTIIVW6YQLW7O/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-28T06:51:06Z","links":{"resolver":"https://pith.science/pith/DTUTXZ6HYDYS6YTIIVW6YQLW7O","bundle":"https://pith.science/pith/DTUTXZ6HYDYS6YTIIVW6YQLW7O/bundle.json","state":"https://pith.science/pith/DTUTXZ6HYDYS6YTIIVW6YQLW7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTUTXZ6HYDYS6YTIIVW6YQLW7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DTUTXZ6HYDYS6YTIIVW6YQLW7O","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":"22bdbfcbaa27472c5d742a81199afa12768e9d1ed708e5bc4b92ae76bcc9a5e6","cross_cats_sorted":["cs.DM","math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-08T12:36:25Z","title_canon_sha256":"cbf5fca7da9d8ae11e23e3f55868b3cbf86ef427d536608302a21396d0d63ff6"},"schema_version":"1.0","source":{"id":"1404.2106","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2106","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2106v2","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2106","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"DTUTXZ6HYDYS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DTUTXZ6HYDYS6YTI","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DTUTXZ6H","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:87825854db8e3b21338cc2802e0edd9f667e2060d981184ae982d8bc2c65d014","target":"graph","created_at":"2026-05-18T02:17:12Z","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":"For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the given graph, it is well-known that the (sharp) threshold is at $p=1/n$. We consider a natural analogue of this question for higher-dimensional random complexes $X^k(n,p)$, first studied by Cohen, Costa, Farber and Kappeler for $k=2$.\n  Improving previous results, we show that $p=\\Theta(1/\\sqrt{n})$ is the (coarse) threshold for containing a subdivision of an","authors_text":"Anna Gundert, Uli Wagner","cross_cats":["cs.DM","math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-08T12:36:25Z","title":"On Topological Minors in Random Simplicial Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2106","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:b9f1ed2000753558412d3b6748b52f3074ebbc3111e8abedc90fa7b95e676963","target":"record","created_at":"2026-05-18T02:17:12Z","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":"22bdbfcbaa27472c5d742a81199afa12768e9d1ed708e5bc4b92ae76bcc9a5e6","cross_cats_sorted":["cs.DM","math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-08T12:36:25Z","title_canon_sha256":"cbf5fca7da9d8ae11e23e3f55868b3cbf86ef427d536608302a21396d0d63ff6"},"schema_version":"1.0","source":{"id":"1404.2106","kind":"arxiv","version":2}},"canonical_sha256":"1ce93be7c7c0f12f6268456dec4176fb974d291d65079a4e6ffb48835db72d29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ce93be7c7c0f12f6268456dec4176fb974d291d65079a4e6ffb48835db72d29","first_computed_at":"2026-05-18T02:17:12.274079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:12.274079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t+9U018/OmUCbAyA7y+LK92HYe7hhO0uuHqb2OpuGCVQcLojwhawwPGm66eMyNiL58zCAEbfChf5Rpv0WNa4AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:12.274826Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.2106","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9f1ed2000753558412d3b6748b52f3074ebbc3111e8abedc90fa7b95e676963","sha256:87825854db8e3b21338cc2802e0edd9f667e2060d981184ae982d8bc2c65d014"],"state_sha256":"1ff4af0a29ea5778f1ef18a7b3515c0fb3a1b4d61668c2afc8de78a546f2413f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Djw0NEzVFGYDCeedFr8Ax1iNCeJf2DX+nnWF/SooiaAdxGTkCDyGYf3Zuvb59HTQ89NO2cFSMeLQyoUGguxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:51:06.405521Z","bundle_sha256":"6df81e46c94858ff1fde116ed774dce81e911318740d55a33c5e08745960bcab"}}