{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LPL7ASNEHEM2RI7V3TRZYUJWAE","short_pith_number":"pith:LPL7ASNE","schema_version":"1.0","canonical_sha256":"5bd7f049a43919a8a3f5dce39c51360116a369bdb2eb3d2050fc7f4ee56960a9","source":{"kind":"arxiv","id":"2507.03676","version":1},"attestation_state":"computed","paper":{"title":"Robustness of the Sauer-Spencer Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julia B\\\"ottcher, Mihir Neve, Peter Allen, Yoshiharu Kohayakawa","submitted_at":"2025-07-04T15:51:52Z","abstract_excerpt":"We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G(p)$ to be a random subgraph of $G$ obtained by retaining each edge of $G$ independently with probability $p \\in [0,1]$, and let $m_1(H)$ be the maximum $1$-density of a graph $H$. We show that for any constant $\\Delta$ and $\\gamma > 0$, if $G$ is an $n$-vertex host graph with minimum degree $\\delta(G) \\geq (1 - 1/2\\Delta + \\gamma)n$ and $H$ is an $n$-vertex graph with maximum degree $\\Delta(H) \\leq \\Delta$, then for $p \\geq Cn^{-1/m_1(H)}\\log n$, the random subgraph $G(p)$ "},"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":"2507.03676","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-04T15:51:52Z","cross_cats_sorted":[],"title_canon_sha256":"861c253b45925d63c142145df11cee1056fb103f39e033a35e9c0612ec44c3cc","abstract_canon_sha256":"b8013cc63f399d3201c9902d8540491c5cb72134bd4eb79729a90f1967ec79f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:03.524704Z","signature_b64":"ZG2yXvMj7dlKajy0Imsc6kUkyK/DG6cIKDHHP6z9JjZLFvp4xn7dK/tWLnEw2QXLqDPUzzGmgATx5KIQ42M3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bd7f049a43919a8a3f5dce39c51360116a369bdb2eb3d2050fc7f4ee56960a9","last_reissued_at":"2026-07-05T11:32:03.524233Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:03.524233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robustness of the Sauer-Spencer Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julia B\\\"ottcher, Mihir Neve, Peter Allen, Yoshiharu Kohayakawa","submitted_at":"2025-07-04T15:51:52Z","abstract_excerpt":"We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G(p)$ to be a random subgraph of $G$ obtained by retaining each edge of $G$ independently with probability $p \\in [0,1]$, and let $m_1(H)$ be the maximum $1$-density of a graph $H$. We show that for any constant $\\Delta$ and $\\gamma > 0$, if $G$ is an $n$-vertex host graph with minimum degree $\\delta(G) \\geq (1 - 1/2\\Delta + \\gamma)n$ and $H$ is an $n$-vertex graph with maximum degree $\\Delta(H) \\leq \\Delta$, then for $p \\geq Cn^{-1/m_1(H)}\\log n$, the random subgraph $G(p)$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03676","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.03676/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":"2507.03676","created_at":"2026-07-05T11:32:03.524288+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.03676v1","created_at":"2026-07-05T11:32:03.524288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03676","created_at":"2026-07-05T11:32:03.524288+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPL7ASNEHEM2","created_at":"2026-07-05T11:32:03.524288+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPL7ASNEHEM2RI7V","created_at":"2026-07-05T11:32:03.524288+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPL7ASNE","created_at":"2026-07-05T11:32:03.524288+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LPL7ASNEHEM2RI7V3TRZYUJWAE","json":"https://pith.science/pith/LPL7ASNEHEM2RI7V3TRZYUJWAE.json","graph_json":"https://pith.science/api/pith-number/LPL7ASNEHEM2RI7V3TRZYUJWAE/graph.json","events_json":"https://pith.science/api/pith-number/LPL7ASNEHEM2RI7V3TRZYUJWAE/events.json","paper":"https://pith.science/paper/LPL7ASNE"},"agent_actions":{"view_html":"https://pith.science/pith/LPL7ASNEHEM2RI7V3TRZYUJWAE","download_json":"https://pith.science/pith/LPL7ASNEHEM2RI7V3TRZYUJWAE.json","view_paper":"https://pith.science/paper/LPL7ASNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.03676&json=true","fetch_graph":"https://pith.science/api/pith-number/LPL7ASNEHEM2RI7V3TRZYUJWAE/graph.json","fetch_events":"https://pith.science/api/pith-number/LPL7ASNEHEM2RI7V3TRZYUJWAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPL7ASNEHEM2RI7V3TRZYUJWAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPL7ASNEHEM2RI7V3TRZYUJWAE/action/storage_attestation","attest_author":"https://pith.science/pith/LPL7ASNEHEM2RI7V3TRZYUJWAE/action/author_attestation","sign_citation":"https://pith.science/pith/LPL7ASNEHEM2RI7V3TRZYUJWAE/action/citation_signature","submit_replication":"https://pith.science/pith/LPL7ASNEHEM2RI7V3TRZYUJWAE/action/replication_record"}},"created_at":"2026-07-05T11:32:03.524288+00:00","updated_at":"2026-07-05T11:32:03.524288+00:00"}