{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:B4JNG5JTH4IBGQUXUCRTGDK6QD","short_pith_number":"pith:B4JNG5JT","canonical_record":{"source":{"id":"2501.14286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T06:58:11Z","cross_cats_sorted":[],"title_canon_sha256":"7daebd42714cc37a35734fee7241a4104494f9e4d89df8b4f86e7ba68f86154d","abstract_canon_sha256":"2849984ddd837b44adbf616f490b7ff4b8fbfc38fe858305116dd3b329aac7c3"},"schema_version":"1.0"},"canonical_sha256":"0f12d375333f10134297a0a3330d5e80e8698c19bcbfeb26bba82fe4da2e4888","source":{"kind":"arxiv","id":"2501.14286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.14286","created_at":"2026-07-05T10:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2501.14286v1","created_at":"2026-07-05T10:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14286","created_at":"2026-07-05T10:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"B4JNG5JTH4IB","created_at":"2026-07-05T10:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"B4JNG5JTH4IBGQUX","created_at":"2026-07-05T10:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"B4JNG5JT","created_at":"2026-07-05T10:04:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:B4JNG5JTH4IBGQUXUCRTGDK6QD","target":"record","payload":{"canonical_record":{"source":{"id":"2501.14286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T06:58:11Z","cross_cats_sorted":[],"title_canon_sha256":"7daebd42714cc37a35734fee7241a4104494f9e4d89df8b4f86e7ba68f86154d","abstract_canon_sha256":"2849984ddd837b44adbf616f490b7ff4b8fbfc38fe858305116dd3b329aac7c3"},"schema_version":"1.0"},"canonical_sha256":"0f12d375333f10134297a0a3330d5e80e8698c19bcbfeb26bba82fe4da2e4888","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:48.234730Z","signature_b64":"cdJllmg5EjVwK6MNNBUko3TngmlM6umFKc2h1ptlf6zCCniJEv8FgsbfC+Ju7QkGIbLKQm4dmT5oP6QbyGNDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f12d375333f10134297a0a3330d5e80e8698c19bcbfeb26bba82fe4da2e4888","last_reissued_at":"2026-07-05T10:04:48.234293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:48.234293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.14286","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-07-05T10:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DP2RRFwe430nt+oWOy4FtkoUYEdIYKMdh4Pb/mxXXhMHB6nMlipq0LiroAtaf8G87PwA8pFJpsU+EEkG1ZfgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:50:32.587231Z"},"content_sha256":"2ee1bd9d41aa2205fcdd93890a2f680aaa1f48e0718879406b7c256a2acb4a02","schema_version":"1.0","event_id":"sha256:2ee1bd9d41aa2205fcdd93890a2f680aaa1f48e0718879406b7c256a2acb4a02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:B4JNG5JTH4IBGQUXUCRTGDK6QD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Embedding edge-colored graphs in expanders with roll-back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Lund, Chuandong Xu","submitted_at":"2025-01-24T06:58:11Z","abstract_excerpt":"We introduce a method to embed edge-colored graphs into families of expander graphs, which generalizes a framework developed by Dragani\\'c, Krivelevich, and Nenadov (2022). As an application, we show that each family of sufficiently pseudo-random graphs on $n$ vertices contains every edge-colored subdivision of $K_\\Delta$, provided that the distance between branch vertices in the subdivision is large enough, the average degree of each graph in the family is at least $(1+o(1))\\Delta$, and the number of vertices in the subdivision is at most $(1-o(1))n$.\n  This work is motivated in part by the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14286","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/2501.14286/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-05T10:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zE+SHNdJMS8Nc/oGmwCqNetlq6L/a+kRKXkl9ObioBVO1C9ZTDwe4qStSsDWQ3MuhTtsmuZUWfx3nNiPFpZLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:50:32.587603Z"},"content_sha256":"ea61cca3efc0a28a70dcdae4e3b5c77e655907c2d47a0d84838657c0a251f123","schema_version":"1.0","event_id":"sha256:ea61cca3efc0a28a70dcdae4e3b5c77e655907c2d47a0d84838657c0a251f123"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4JNG5JTH4IBGQUXUCRTGDK6QD/bundle.json","state_url":"https://pith.science/pith/B4JNG5JTH4IBGQUXUCRTGDK6QD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4JNG5JTH4IBGQUXUCRTGDK6QD/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-19T15:50:32Z","links":{"resolver":"https://pith.science/pith/B4JNG5JTH4IBGQUXUCRTGDK6QD","bundle":"https://pith.science/pith/B4JNG5JTH4IBGQUXUCRTGDK6QD/bundle.json","state":"https://pith.science/pith/B4JNG5JTH4IBGQUXUCRTGDK6QD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4JNG5JTH4IBGQUXUCRTGDK6QD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:B4JNG5JTH4IBGQUXUCRTGDK6QD","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":"2849984ddd837b44adbf616f490b7ff4b8fbfc38fe858305116dd3b329aac7c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T06:58:11Z","title_canon_sha256":"7daebd42714cc37a35734fee7241a4104494f9e4d89df8b4f86e7ba68f86154d"},"schema_version":"1.0","source":{"id":"2501.14286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.14286","created_at":"2026-07-05T10:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2501.14286v1","created_at":"2026-07-05T10:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14286","created_at":"2026-07-05T10:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"B4JNG5JTH4IB","created_at":"2026-07-05T10:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"B4JNG5JTH4IBGQUX","created_at":"2026-07-05T10:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"B4JNG5JT","created_at":"2026-07-05T10:04:48Z"}],"graph_snapshots":[{"event_id":"sha256:ea61cca3efc0a28a70dcdae4e3b5c77e655907c2d47a0d84838657c0a251f123","target":"graph","created_at":"2026-07-05T10:04:48Z","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/2501.14286/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a method to embed edge-colored graphs into families of expander graphs, which generalizes a framework developed by Dragani\\'c, Krivelevich, and Nenadov (2022). As an application, we show that each family of sufficiently pseudo-random graphs on $n$ vertices contains every edge-colored subdivision of $K_\\Delta$, provided that the distance between branch vertices in the subdivision is large enough, the average degree of each graph in the family is at least $(1+o(1))\\Delta$, and the number of vertices in the subdivision is at most $(1-o(1))n$.\n  This work is motivated in part by the p","authors_text":"Ben Lund, Chuandong Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T06:58:11Z","title":"Embedding edge-colored graphs in expanders with roll-back"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14286","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:2ee1bd9d41aa2205fcdd93890a2f680aaa1f48e0718879406b7c256a2acb4a02","target":"record","created_at":"2026-07-05T10:04:48Z","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":"2849984ddd837b44adbf616f490b7ff4b8fbfc38fe858305116dd3b329aac7c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T06:58:11Z","title_canon_sha256":"7daebd42714cc37a35734fee7241a4104494f9e4d89df8b4f86e7ba68f86154d"},"schema_version":"1.0","source":{"id":"2501.14286","kind":"arxiv","version":1}},"canonical_sha256":"0f12d375333f10134297a0a3330d5e80e8698c19bcbfeb26bba82fe4da2e4888","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f12d375333f10134297a0a3330d5e80e8698c19bcbfeb26bba82fe4da2e4888","first_computed_at":"2026-07-05T10:04:48.234293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:04:48.234293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cdJllmg5EjVwK6MNNBUko3TngmlM6umFKc2h1ptlf6zCCniJEv8FgsbfC+Ju7QkGIbLKQm4dmT5oP6QbyGNDCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:04:48.234730Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.14286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ee1bd9d41aa2205fcdd93890a2f680aaa1f48e0718879406b7c256a2acb4a02","sha256:ea61cca3efc0a28a70dcdae4e3b5c77e655907c2d47a0d84838657c0a251f123"],"state_sha256":"a13c9e470911cdb0e762f82f60d8ff4d448829ee073b9229099548d204c10e8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0iU5BHBwQmQAW8kQNZWXxMx5VvvzwuZmG1HSnTt0Yt/bJG36SPt6mT4bnpO29pTPMGBclizjUPnnTU3sBM08AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T15:50:32.590099Z","bundle_sha256":"55f4207945833740d159d091bd6306444355b64b4adb2e19fb2b87d23c2d541f"}}