{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GHCFPCTESV4PXPL7YX6PNFNU4A","short_pith_number":"pith:GHCFPCTE","canonical_record":{"source":{"id":"1806.00493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-01T18:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"c11fd6289c8e5fc77928a6543942453858ed1ce77da80883a3e1285634fa5cf9","abstract_canon_sha256":"e95def9e95e2b613d343d6ba0a05eaa79cab2b74c2dc680a8aee8afff05cff16"},"schema_version":"1.0"},"canonical_sha256":"31c4578a649578fbbd7fc5fcf695b4e0278ad5af12c6b48362996231a6ab9afc","source":{"kind":"arxiv","id":"1806.00493","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00493","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00493v1","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00493","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"pith_short_12","alias_value":"GHCFPCTESV4P","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GHCFPCTESV4PXPL7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GHCFPCTE","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GHCFPCTESV4PXPL7YX6PNFNU4A","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-01T18:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"c11fd6289c8e5fc77928a6543942453858ed1ce77da80883a3e1285634fa5cf9","abstract_canon_sha256":"e95def9e95e2b613d343d6ba0a05eaa79cab2b74c2dc680a8aee8afff05cff16"},"schema_version":"1.0"},"canonical_sha256":"31c4578a649578fbbd7fc5fcf695b4e0278ad5af12c6b48362996231a6ab9afc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:21.076149Z","signature_b64":"Ib9AdpR9B2WOvg6qD1e3SVob8oAE+IQJ0u1N8HYIjtG3JossbNA6oT5Ky8S5qAZ6VKKecAESODW2M+m2TkevCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31c4578a649578fbbd7fc5fcf695b4e0278ad5af12c6b48362996231a6ab9afc","last_reissued_at":"2026-05-18T00:14:21.075455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:21.075455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00493","source_version":1,"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-18T00:14:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dsGQ0VveDrlIi0OuN8kaeV6HuGIsWGIKaSf0t5baSPB16ltmDfFyX+QwEDRsMfAjxUJ/yK0D0Wtb8/ypeVEKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:42:59.773375Z"},"content_sha256":"031991b7047740ef74cc4234636d58ebef13925739672175050131649a134781","schema_version":"1.0","event_id":"sha256:031991b7047740ef74cc4234636d58ebef13925739672175050131649a134781"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GHCFPCTESV4PXPL7YX6PNFNU4A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-perfect clique-factors in sparse pseudorandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Yoshiharu Kohayakawa, Yury Person","submitted_at":"2018-06-01T18:09:19Z","abstract_excerpt":"We prove that, for any $t\\ge 3$, there exists a constant $c=c(t)>0$ such that any $d$-regular $n$-vertex graph with the second largest eigenvalue in absolute value~$\\lambda$ satisfying $\\lambda\\le c d^{t-1}/n^{t-2}$ contains vertex-disjoint copies of $K_t$ covering all but at most $n^{1-1/(8t^4)}$ vertices. This provides further support for the conjecture of Krivelevich, Sudakov and Sz\\'abo [\\emph{Triangle factors in sparse pseudo-random graphs}, Combinatorica \\textbf{24} (2004), pp.~403--426] that $(n,d,\\lambda)$-graphs with $n\\in 3\\mathbb{N}$ and $\\lambda\\leq cd^{2}/n$ for a suitably small a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00493","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":""},"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-18T00:14:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UuIGmq9RUavKXNCTwvriEZEOQLMQAlqFUG29VVSTVYtM6mscaZKOFKGXwLSIkgP6BhXP0Nr/TfZ1Aq3c8ql3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:42:59.773731Z"},"content_sha256":"d6afcffdd4beeafb28ece71527f1094277c921c5528aec272cfd969d3e7fccef","schema_version":"1.0","event_id":"sha256:d6afcffdd4beeafb28ece71527f1094277c921c5528aec272cfd969d3e7fccef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A/bundle.json","state_url":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GHCFPCTESV4PXPL7YX6PNFNU4A/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-06-04T22:42:59Z","links":{"resolver":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A","bundle":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A/bundle.json","state":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GHCFPCTESV4PXPL7YX6PNFNU4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GHCFPCTESV4PXPL7YX6PNFNU4A","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":"e95def9e95e2b613d343d6ba0a05eaa79cab2b74c2dc680a8aee8afff05cff16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-01T18:09:19Z","title_canon_sha256":"c11fd6289c8e5fc77928a6543942453858ed1ce77da80883a3e1285634fa5cf9"},"schema_version":"1.0","source":{"id":"1806.00493","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00493","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00493v1","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00493","created_at":"2026-05-18T00:14:21Z"},{"alias_kind":"pith_short_12","alias_value":"GHCFPCTESV4P","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GHCFPCTESV4PXPL7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GHCFPCTE","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:d6afcffdd4beeafb28ece71527f1094277c921c5528aec272cfd969d3e7fccef","target":"graph","created_at":"2026-05-18T00:14:21Z","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":"We prove that, for any $t\\ge 3$, there exists a constant $c=c(t)>0$ such that any $d$-regular $n$-vertex graph with the second largest eigenvalue in absolute value~$\\lambda$ satisfying $\\lambda\\le c d^{t-1}/n^{t-2}$ contains vertex-disjoint copies of $K_t$ covering all but at most $n^{1-1/(8t^4)}$ vertices. This provides further support for the conjecture of Krivelevich, Sudakov and Sz\\'abo [\\emph{Triangle factors in sparse pseudo-random graphs}, Combinatorica \\textbf{24} (2004), pp.~403--426] that $(n,d,\\lambda)$-graphs with $n\\in 3\\mathbb{N}$ and $\\lambda\\leq cd^{2}/n$ for a suitably small a","authors_text":"Jie Han, Yoshiharu Kohayakawa, Yury Person","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-01T18:09:19Z","title":"Near-perfect clique-factors in sparse pseudorandom graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00493","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:031991b7047740ef74cc4234636d58ebef13925739672175050131649a134781","target":"record","created_at":"2026-05-18T00:14:21Z","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":"e95def9e95e2b613d343d6ba0a05eaa79cab2b74c2dc680a8aee8afff05cff16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-01T18:09:19Z","title_canon_sha256":"c11fd6289c8e5fc77928a6543942453858ed1ce77da80883a3e1285634fa5cf9"},"schema_version":"1.0","source":{"id":"1806.00493","kind":"arxiv","version":1}},"canonical_sha256":"31c4578a649578fbbd7fc5fcf695b4e0278ad5af12c6b48362996231a6ab9afc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31c4578a649578fbbd7fc5fcf695b4e0278ad5af12c6b48362996231a6ab9afc","first_computed_at":"2026-05-18T00:14:21.075455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:21.075455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ib9AdpR9B2WOvg6qD1e3SVob8oAE+IQJ0u1N8HYIjtG3JossbNA6oT5Ky8S5qAZ6VKKecAESODW2M+m2TkevCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:21.076149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00493","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:031991b7047740ef74cc4234636d58ebef13925739672175050131649a134781","sha256:d6afcffdd4beeafb28ece71527f1094277c921c5528aec272cfd969d3e7fccef"],"state_sha256":"c2e0c436cfc88207c874276987fc926622d69456fdbaab755642b52410072d89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xJRiFrEX/juZhm+eYvjKs4e5AuhhOye/kYOhWWQ5XTP1cp+sDanGz55D3oII/tjz6tM4JSeuQQU7HKTWlg3sCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:42:59.775790Z","bundle_sha256":"cedc1741681283c3e2708126574be59b83e0ad2a87ac52bbbc2fdf5746a5ae37"}}