{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LPL7ASNEHEM2RI7V3TRZYUJWAE","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":"b8013cc63f399d3201c9902d8540491c5cb72134bd4eb79729a90f1967ec79f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-04T15:51:52Z","title_canon_sha256":"861c253b45925d63c142145df11cee1056fb103f39e033a35e9c0612ec44c3cc"},"schema_version":"1.0","source":{"id":"2507.03676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.03676","created_at":"2026-07-05T11:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"2507.03676v1","created_at":"2026-07-05T11:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03676","created_at":"2026-07-05T11:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"LPL7ASNEHEM2","created_at":"2026-07-05T11:32:03Z"},{"alias_kind":"pith_short_16","alias_value":"LPL7ASNEHEM2RI7V","created_at":"2026-07-05T11:32:03Z"},{"alias_kind":"pith_short_8","alias_value":"LPL7ASNE","created_at":"2026-07-05T11:32:03Z"}],"graph_snapshots":[{"event_id":"sha256:5bcb7131e9faf13a5af8d3e09287a078a8e019f651e94cd89e0b9a06ba893967","target":"graph","created_at":"2026-07-05T11:32:03Z","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/2507.03676/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)$ ","authors_text":"Julia B\\\"ottcher, Mihir Neve, Peter Allen, Yoshiharu Kohayakawa","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-04T15:51:52Z","title":"Robustness of the Sauer-Spencer Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03676","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:d5bd51b06aa26222297b19f29a6b48b7fe0e053473bc8f203eb82400b3f37734","target":"record","created_at":"2026-07-05T11:32:03Z","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":"b8013cc63f399d3201c9902d8540491c5cb72134bd4eb79729a90f1967ec79f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-04T15:51:52Z","title_canon_sha256":"861c253b45925d63c142145df11cee1056fb103f39e033a35e9c0612ec44c3cc"},"schema_version":"1.0","source":{"id":"2507.03676","kind":"arxiv","version":1}},"canonical_sha256":"5bd7f049a43919a8a3f5dce39c51360116a369bdb2eb3d2050fc7f4ee56960a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bd7f049a43919a8a3f5dce39c51360116a369bdb2eb3d2050fc7f4ee56960a9","first_computed_at":"2026-07-05T11:32:03.524233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:32:03.524233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZG2yXvMj7dlKajy0Imsc6kUkyK/DG6cIKDHHP6z9JjZLFvp4xn7dK/tWLnEw2QXLqDPUzzGmgATx5KIQ42M3Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:32:03.524704Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.03676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5bd51b06aa26222297b19f29a6b48b7fe0e053473bc8f203eb82400b3f37734","sha256:5bcb7131e9faf13a5af8d3e09287a078a8e019f651e94cd89e0b9a06ba893967"],"state_sha256":"e9640aad3ab2408f58e782f9845981ed8dc10ebd04745b79ffcc5bb75dfb69bc"}