{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GWARXM6C7SRKLLI3ODGPL5XSX6","short_pith_number":"pith:GWARXM6C","schema_version":"1.0","canonical_sha256":"35811bb3c2fca2a5ad1b70ccf5f6f2bf8457816592c7df940470824ca88e582c","source":{"kind":"arxiv","id":"2307.00322","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2307.00322","created_at":"2026-07-05T07:09:29.968234+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.00322v2","created_at":"2026-07-05T07:09:29.968234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.00322","created_at":"2026-07-05T07:09:29.968234+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWARXM6C7SRK","created_at":"2026-07-05T07:09:29.968234+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWARXM6C7SRKLLI3","created_at":"2026-07-05T07:09:29.968234+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWARXM6C","created_at":"2026-07-05T07:09:29.968234+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19756","citing_title":"Tree tilings in random regular graphs","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6","json":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6.json","graph_json":"https://pith.science/api/pith-number/GWARXM6C7SRKLLI3ODGPL5XSX6/graph.json","events_json":"https://pith.science/api/pith-number/GWARXM6C7SRKLLI3ODGPL5XSX6/events.json","paper":"https://pith.science/paper/GWARXM6C"},"agent_actions":{"view_html":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6","download_json":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6.json","view_paper":"https://pith.science/paper/GWARXM6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.00322&json=true","fetch_graph":"https://pith.science/api/pith-number/GWARXM6C7SRKLLI3ODGPL5XSX6/graph.json","fetch_events":"https://pith.science/api/pith-number/GWARXM6C7SRKLLI3ODGPL5XSX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6/action/storage_attestation","attest_author":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6/action/author_attestation","sign_citation":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6/action/citation_signature","submit_replication":"https://pith.science/pith/GWARXM6C7SRKLLI3ODGPL5XSX6/action/replication_record"}},"created_at":"2026-07-05T07:09:29.968234+00:00","updated_at":"2026-07-05T07:09:29.968234+00:00"}