{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GWARXM6C7SRKLLI3ODGPL5XSX6","short_pith_number":"pith:GWARXM6C","canonical_record":{"source":{"id":"2307.00322","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-01T12:28:44Z","cross_cats_sorted":[],"title_canon_sha256":"106a47e70f39eed131ff0de501e7c49e5db3c74671e5a8af756d3fac1cf219ef","abstract_canon_sha256":"f2b367344b27185d7bef05c50bd16b5b49459de83a1e7ea06f5bcf099a21e613"},"schema_version":"1.0"},"canonical_sha256":"35811bb3c2fca2a5ad1b70ccf5f6f2bf8457816592c7df940470824ca88e582c","source":{"kind":"arxiv","id":"2307.00322","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.00322","created_at":"2026-07-05T07:09:29Z"},{"alias_kind":"arxiv_version","alias_value":"2307.00322v2","created_at":"2026-07-05T07:09:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.00322","created_at":"2026-07-05T07:09:29Z"},{"alias_kind":"pith_short_12","alias_value":"GWARXM6C7SRK","created_at":"2026-07-05T07:09:29Z"},{"alias_kind":"pith_short_16","alias_value":"GWARXM6C7SRKLLI3","created_at":"2026-07-05T07:09:29Z"},{"alias_kind":"pith_short_8","alias_value":"GWARXM6C","created_at":"2026-07-05T07:09:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GWARXM6C7SRKLLI3ODGPL5XSX6","target":"record","payload":{"canonical_record":{"source":{"id":"2307.00322","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-01T12:28:44Z","cross_cats_sorted":[],"title_canon_sha256":"106a47e70f39eed131ff0de501e7c49e5db3c74671e5a8af756d3fac1cf219ef","abstract_canon_sha256":"f2b367344b27185d7bef05c50bd16b5b49459de83a1e7ea06f5bcf099a21e613"},"schema_version":"1.0"},"canonical_sha256":"35811bb3c2fca2a5ad1b70ccf5f6f2bf8457816592c7df940470824ca88e582c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:29.968738Z","signature_b64":"P3eKIBhYFZhLqOMFE1JGeWk6r9Cw7ao2xCjig0OjfwV6QCLvE/YckA8ofadozt+p7Vf14o96QaKZp3v2er4TAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35811bb3c2fca2a5ad1b70ccf5f6f2bf8457816592c7df940470824ca88e582c","last_reissued_at":"2026-07-05T07:09:29.968144Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:29.968144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.00322","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-05T07:09:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mu2/NWun1zN22C6r//agU36isiJ1OSG3eZbOsuAyXF8ub4MdXDUZhcLET5ZHEjXiiSm8ps+Mu0QqdixYRkf6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:08:42.726998Z"},"content_sha256":"249e29e6b81a718275a469e4b537fd2f9d56e43eeb3e90111ca3e59177abc46f","schema_version":"1.0","event_id":"sha256:249e29e6b81a718275a469e4b537fd2f9d56e43eeb3e90111ca3e59177abc46f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GWARXM6C7SRKLLI3ODGPL5XSX6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning trees in the square of pseudorandom graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mat\\'ias Pavez-Sign\\'e","submitted_at":"2023-07-01T12:28:44Z","abstract_excerpt":"We show that for every $\\Delta\\in\\mathbb N$, there exists a constant $C$ such that if $G$ is an $(n,d,\\lambda)$-graph with $d/\\lambda\\ge C$ and $d$ is large enough, then $G^2$ contains every $n$-vertex tree with maximum degree bounded by $\\Delta$. This answers a question of Krivelevich."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.00322","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/2307.00322/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-05T07:09:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYdWM/SZNOF8t9o6D/j6K06rxzJ7b802S34phcuUvb5QmtELfg9ivUbuHMi5aqOZpvNqxMUVOf7s7o3dt2jSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:08:42.727506Z"},"content_sha256":"7c403c901a6c44ec898e7678a5246caa76df6afd22c3f4e13728915206bb6a9d","schema_version":"1.0","event_id":"sha256:7c403c901a6c44ec898e7678a5246caa76df6afd22c3f4e13728915206bb6a9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6/bundle.json","state_url":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWARXM6C7SRKLLI3ODGPL5XSX6/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-19T16:08:42Z","links":{"resolver":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6","bundle":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6/bundle.json","state":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWARXM6C7SRKLLI3ODGPL5XSX6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GWARXM6C7SRKLLI3ODGPL5XSX6","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":"f2b367344b27185d7bef05c50bd16b5b49459de83a1e7ea06f5bcf099a21e613","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-01T12:28:44Z","title_canon_sha256":"106a47e70f39eed131ff0de501e7c49e5db3c74671e5a8af756d3fac1cf219ef"},"schema_version":"1.0","source":{"id":"2307.00322","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.00322","created_at":"2026-07-05T07:09:29Z"},{"alias_kind":"arxiv_version","alias_value":"2307.00322v2","created_at":"2026-07-05T07:09:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.00322","created_at":"2026-07-05T07:09:29Z"},{"alias_kind":"pith_short_12","alias_value":"GWARXM6C7SRK","created_at":"2026-07-05T07:09:29Z"},{"alias_kind":"pith_short_16","alias_value":"GWARXM6C7SRKLLI3","created_at":"2026-07-05T07:09:29Z"},{"alias_kind":"pith_short_8","alias_value":"GWARXM6C","created_at":"2026-07-05T07:09:29Z"}],"graph_snapshots":[{"event_id":"sha256:7c403c901a6c44ec898e7678a5246caa76df6afd22c3f4e13728915206bb6a9d","target":"graph","created_at":"2026-07-05T07:09:29Z","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/2307.00322/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that for every $\\Delta\\in\\mathbb N$, there exists a constant $C$ such that if $G$ is an $(n,d,\\lambda)$-graph with $d/\\lambda\\ge C$ and $d$ is large enough, then $G^2$ contains every $n$-vertex tree with maximum degree bounded by $\\Delta$. This answers a question of Krivelevich.","authors_text":"Mat\\'ias Pavez-Sign\\'e","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-01T12:28:44Z","title":"Spanning trees in the square of pseudorandom graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.00322","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:249e29e6b81a718275a469e4b537fd2f9d56e43eeb3e90111ca3e59177abc46f","target":"record","created_at":"2026-07-05T07:09:29Z","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":"f2b367344b27185d7bef05c50bd16b5b49459de83a1e7ea06f5bcf099a21e613","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-01T12:28:44Z","title_canon_sha256":"106a47e70f39eed131ff0de501e7c49e5db3c74671e5a8af756d3fac1cf219ef"},"schema_version":"1.0","source":{"id":"2307.00322","kind":"arxiv","version":2}},"canonical_sha256":"35811bb3c2fca2a5ad1b70ccf5f6f2bf8457816592c7df940470824ca88e582c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35811bb3c2fca2a5ad1b70ccf5f6f2bf8457816592c7df940470824ca88e582c","first_computed_at":"2026-07-05T07:09:29.968144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:09:29.968144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P3eKIBhYFZhLqOMFE1JGeWk6r9Cw7ao2xCjig0OjfwV6QCLvE/YckA8ofadozt+p7Vf14o96QaKZp3v2er4TAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:09:29.968738Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.00322","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:249e29e6b81a718275a469e4b537fd2f9d56e43eeb3e90111ca3e59177abc46f","sha256:7c403c901a6c44ec898e7678a5246caa76df6afd22c3f4e13728915206bb6a9d"],"state_sha256":"b9169fbcc89e885820d5fcef3723f6b50968976eb3ac60babff483ff472bbf44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lreB2j6+s8nSTvjGnUfqf0b1/8tS4rVJgcV5J35g5nykbnpp8VNc04wSnk8WqyIbggYgPrVdmPhymNg9WBZDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T16:08:42.733592Z","bundle_sha256":"32405615cfd25dc1a27bdfcd5adae69a16f56e08395ba2082d7bb927a16d58db"}}