{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:T6CLG6XWCMLPZIKYKLT2BPCFI2","short_pith_number":"pith:T6CLG6XW","canonical_record":{"source":{"id":"2310.15909","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-24T15:15:13Z","cross_cats_sorted":[],"title_canon_sha256":"9ed1c9d473e49a445df5f35d71bd20611b09ed03ddf9995f6e0a83028deaf2b4","abstract_canon_sha256":"e4077f7b9228f80ca47faa0105947ed1b4defadd5083b507c5cd00266a7fc9a8"},"schema_version":"1.0"},"canonical_sha256":"9f84b37af61316fca15852e7a0bc4546a0d00605a675119b73957f04834afe00","source":{"kind":"arxiv","id":"2310.15909","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.15909","created_at":"2026-07-05T10:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"2310.15909v2","created_at":"2026-07-05T10:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.15909","created_at":"2026-07-05T10:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"T6CLG6XWCMLP","created_at":"2026-07-05T10:39:15Z"},{"alias_kind":"pith_short_16","alias_value":"T6CLG6XWCMLPZIKY","created_at":"2026-07-05T10:39:15Z"},{"alias_kind":"pith_short_8","alias_value":"T6CLG6XW","created_at":"2026-07-05T10:39:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:T6CLG6XWCMLPZIKYKLT2BPCFI2","target":"record","payload":{"canonical_record":{"source":{"id":"2310.15909","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-24T15:15:13Z","cross_cats_sorted":[],"title_canon_sha256":"9ed1c9d473e49a445df5f35d71bd20611b09ed03ddf9995f6e0a83028deaf2b4","abstract_canon_sha256":"e4077f7b9228f80ca47faa0105947ed1b4defadd5083b507c5cd00266a7fc9a8"},"schema_version":"1.0"},"canonical_sha256":"9f84b37af61316fca15852e7a0bc4546a0d00605a675119b73957f04834afe00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:39:15.713427Z","signature_b64":"FuS+poul7oGnhXP1bt9enh6/g/fycv/5JwQq3d2A4ey3+KKa69xtH1w7eeml1Ez2Rv48UbXLaiBzqawdO0FCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f84b37af61316fca15852e7a0bc4546a0d00605a675119b73957f04834afe00","last_reissued_at":"2026-07-05T10:39:15.712962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:39:15.712962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.15909","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-07-05T10:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fslb3/bPzmYM0KkuZZGB6h9QKWwxaO0b7omUzexeUBaeIFuzdzNLI2k6aH/AtXmPxaBH3YwiBeE2n3xutkb1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:07:08.871122Z"},"content_sha256":"acee2f47a0c019ec0fe8e7e4014e1803be6928175c3e94928553a5f56d9ef00d","schema_version":"1.0","event_id":"sha256:acee2f47a0c019ec0fe8e7e4014e1803be6928175c3e94928553a5f56d9ef00d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:T6CLG6XWCMLPZIKYKLT2BPCFI2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a high-dimensional Dirac's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hyunwoo Lee","submitted_at":"2023-10-24T15:15:13Z","abstract_excerpt":"Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger uniformity by considering hypergraph matchings and Hamiltonian cycles. In this paper, we consider another natural generalization of perfect matchings, Steiner triple systems. As a Steiner triple system can be viewed as a partition of pairs of vertices, it is a natural high-dimensional analogue of a perfect matching in graphs. We prove that for sufficiently large integer $n$ with $n \\e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.15909","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.15909/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"},"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-07-05T10:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01N48pHIeBTf3ooBKfALQawSLbeFTBaF8vj+4pDPqZ5mmD09SmH0UGzUnYHuHnEYFbe40dkHCbE5YJ6ROr3PDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:07:08.871752Z"},"content_sha256":"ce85e07ba2ce0f2369abc971f826b37f370104d2ff00b32d31c53489e5806eee","schema_version":"1.0","event_id":"sha256:ce85e07ba2ce0f2369abc971f826b37f370104d2ff00b32d31c53489e5806eee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T6CLG6XWCMLPZIKYKLT2BPCFI2/bundle.json","state_url":"https://pith.science/pith/T6CLG6XWCMLPZIKYKLT2BPCFI2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T6CLG6XWCMLPZIKYKLT2BPCFI2/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-08-13T15:07:08Z","links":{"resolver":"https://pith.science/pith/T6CLG6XWCMLPZIKYKLT2BPCFI2","bundle":"https://pith.science/pith/T6CLG6XWCMLPZIKYKLT2BPCFI2/bundle.json","state":"https://pith.science/pith/T6CLG6XWCMLPZIKYKLT2BPCFI2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T6CLG6XWCMLPZIKYKLT2BPCFI2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:T6CLG6XWCMLPZIKYKLT2BPCFI2","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":"e4077f7b9228f80ca47faa0105947ed1b4defadd5083b507c5cd00266a7fc9a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-24T15:15:13Z","title_canon_sha256":"9ed1c9d473e49a445df5f35d71bd20611b09ed03ddf9995f6e0a83028deaf2b4"},"schema_version":"1.0","source":{"id":"2310.15909","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.15909","created_at":"2026-07-05T10:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"2310.15909v2","created_at":"2026-07-05T10:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.15909","created_at":"2026-07-05T10:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"T6CLG6XWCMLP","created_at":"2026-07-05T10:39:15Z"},{"alias_kind":"pith_short_16","alias_value":"T6CLG6XWCMLPZIKY","created_at":"2026-07-05T10:39:15Z"},{"alias_kind":"pith_short_8","alias_value":"T6CLG6XW","created_at":"2026-07-05T10:39:15Z"}],"graph_snapshots":[{"event_id":"sha256:ce85e07ba2ce0f2369abc971f826b37f370104d2ff00b32d31c53489e5806eee","target":"graph","created_at":"2026-07-05T10:39:15Z","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/2310.15909/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger uniformity by considering hypergraph matchings and Hamiltonian cycles. In this paper, we consider another natural generalization of perfect matchings, Steiner triple systems. As a Steiner triple system can be viewed as a partition of pairs of vertices, it is a natural high-dimensional analogue of a perfect matching in graphs. We prove that for sufficiently large integer $n$ with $n \\e","authors_text":"Hyunwoo Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-24T15:15:13Z","title":"Towards a high-dimensional Dirac's theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.15909","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:acee2f47a0c019ec0fe8e7e4014e1803be6928175c3e94928553a5f56d9ef00d","target":"record","created_at":"2026-07-05T10:39:15Z","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":"e4077f7b9228f80ca47faa0105947ed1b4defadd5083b507c5cd00266a7fc9a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-24T15:15:13Z","title_canon_sha256":"9ed1c9d473e49a445df5f35d71bd20611b09ed03ddf9995f6e0a83028deaf2b4"},"schema_version":"1.0","source":{"id":"2310.15909","kind":"arxiv","version":2}},"canonical_sha256":"9f84b37af61316fca15852e7a0bc4546a0d00605a675119b73957f04834afe00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f84b37af61316fca15852e7a0bc4546a0d00605a675119b73957f04834afe00","first_computed_at":"2026-07-05T10:39:15.712962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:39:15.712962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FuS+poul7oGnhXP1bt9enh6/g/fycv/5JwQq3d2A4ey3+KKa69xtH1w7eeml1Ez2Rv48UbXLaiBzqawdO0FCAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:39:15.713427Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.15909","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acee2f47a0c019ec0fe8e7e4014e1803be6928175c3e94928553a5f56d9ef00d","sha256:ce85e07ba2ce0f2369abc971f826b37f370104d2ff00b32d31c53489e5806eee"],"state_sha256":"b37e627832f699e649617b266eb4eef4a1ece1ddedef9257cc2d83678bd32d21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/mUhcjeTr06dn+R3LaZ2b1k5ufI6y8VrpcP/T5YKNfHdToJguHUHnqc8Xh1D20fg+s+bZo4IKV1D8rtemDcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T15:07:08.878318Z","bundle_sha256":"9012820e4b7334baffdae8d550e89f925ff80f5367085de272021f6e757794e5"}}