{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:EBJSW7ASOGHNDEWCLV5SXOOYNU","short_pith_number":"pith:EBJSW7AS","canonical_record":{"source":{"id":"2406.05675","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-09T07:16:07Z","cross_cats_sorted":[],"title_canon_sha256":"f5134e242571320be57f8933f6eef8f411a4fc8eb8034240f70b1ba4b815d8f8","abstract_canon_sha256":"f1789aa135689e80080e18425eea9ad10a9b552988a32b827876c9cd707a3c51"},"schema_version":"1.0"},"canonical_sha256":"20532b7c12718ed192c25d7b2bb9d86d168837cb36088bb17a4092dd47b32588","source":{"kind":"arxiv","id":"2406.05675","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05675","created_at":"2026-07-05T08:29:31Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05675v1","created_at":"2026-07-05T08:29:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05675","created_at":"2026-07-05T08:29:31Z"},{"alias_kind":"pith_short_12","alias_value":"EBJSW7ASOGHN","created_at":"2026-07-05T08:29:31Z"},{"alias_kind":"pith_short_16","alias_value":"EBJSW7ASOGHNDEWC","created_at":"2026-07-05T08:29:31Z"},{"alias_kind":"pith_short_8","alias_value":"EBJSW7AS","created_at":"2026-07-05T08:29:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:EBJSW7ASOGHNDEWCLV5SXOOYNU","target":"record","payload":{"canonical_record":{"source":{"id":"2406.05675","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-09T07:16:07Z","cross_cats_sorted":[],"title_canon_sha256":"f5134e242571320be57f8933f6eef8f411a4fc8eb8034240f70b1ba4b815d8f8","abstract_canon_sha256":"f1789aa135689e80080e18425eea9ad10a9b552988a32b827876c9cd707a3c51"},"schema_version":"1.0"},"canonical_sha256":"20532b7c12718ed192c25d7b2bb9d86d168837cb36088bb17a4092dd47b32588","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:31.818970Z","signature_b64":"2A6K0bbVLBjNf9vouXl/IwyvaXTmsO/ALSnUz25RdtrNOYx2KLGcXa2dskza8bJHLrCKCpYHiZFKoQf2MEOWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20532b7c12718ed192c25d7b2bb9d86d168837cb36088bb17a4092dd47b32588","last_reissued_at":"2026-07-05T08:29:31.818478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:31.818478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.05675","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-05T08:29:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBkZ7Yw6boJBBGDuOv8j8BJgeVry+JMn5YnwSYIydLCTfWhY3ykfyjH3i4oI9V+cevJKpM+OasCw4ke7EutsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T10:21:54.677403Z"},"content_sha256":"bd1a5b396f64badd5ce27edd4a8b539af243909600fbf9b7fa5b0a1b98fc9faf","schema_version":"1.0","event_id":"sha256:bd1a5b396f64badd5ce27edd4a8b539af243909600fbf9b7fa5b0a1b98fc9faf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:EBJSW7ASOGHNDEWCLV5SXOOYNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding irregular subgraphs via local adjustments","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Shengjie Xie","submitted_at":"2024-06-09T07:16:07Z","abstract_excerpt":"For a graph $H$, let $m(H,k)$ denote the number of vertices of degree $k$ in $H$. A conjecture of Alon and Wei states that for any $d\\geq 3$, every $n$-vertex $d$-regular graph contains a spanning subgraph $H$ satisfying $|m(H,k)-\\frac{n}{d+1}|\\leq 2$ for every $0\\leq k \\leq d$. This holds easily when $d\\leq 2$. An asymptotic version of this conjecture was initially established by Frieze, Gould, Karo\\'nski and Pfender, subsequently improved by Alon and Wei, and most recently enhanced by Fox, Luo and Pham, approaching its complete range. All of these approaches relied on probabilistic methods.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05675","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/2406.05675/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-05T08:29:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e8PW7S1o3CzPzfAuQiuvWBh8MY4PWZSNlKgcQnX54kQgOIuuIP5A+L0hIXWUlt/hDa+ZP6yn5BfO71cm1A8RDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T10:21:54.677780Z"},"content_sha256":"3bd15abd1fa1ae7b209662a317e4e520313a301bf23fa693aa5afb646b61d129","schema_version":"1.0","event_id":"sha256:3bd15abd1fa1ae7b209662a317e4e520313a301bf23fa693aa5afb646b61d129"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBJSW7ASOGHNDEWCLV5SXOOYNU/bundle.json","state_url":"https://pith.science/pith/EBJSW7ASOGHNDEWCLV5SXOOYNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBJSW7ASOGHNDEWCLV5SXOOYNU/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-07-10T10:21:54Z","links":{"resolver":"https://pith.science/pith/EBJSW7ASOGHNDEWCLV5SXOOYNU","bundle":"https://pith.science/pith/EBJSW7ASOGHNDEWCLV5SXOOYNU/bundle.json","state":"https://pith.science/pith/EBJSW7ASOGHNDEWCLV5SXOOYNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBJSW7ASOGHNDEWCLV5SXOOYNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EBJSW7ASOGHNDEWCLV5SXOOYNU","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":"f1789aa135689e80080e18425eea9ad10a9b552988a32b827876c9cd707a3c51","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-09T07:16:07Z","title_canon_sha256":"f5134e242571320be57f8933f6eef8f411a4fc8eb8034240f70b1ba4b815d8f8"},"schema_version":"1.0","source":{"id":"2406.05675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05675","created_at":"2026-07-05T08:29:31Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05675v1","created_at":"2026-07-05T08:29:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05675","created_at":"2026-07-05T08:29:31Z"},{"alias_kind":"pith_short_12","alias_value":"EBJSW7ASOGHN","created_at":"2026-07-05T08:29:31Z"},{"alias_kind":"pith_short_16","alias_value":"EBJSW7ASOGHNDEWC","created_at":"2026-07-05T08:29:31Z"},{"alias_kind":"pith_short_8","alias_value":"EBJSW7AS","created_at":"2026-07-05T08:29:31Z"}],"graph_snapshots":[{"event_id":"sha256:3bd15abd1fa1ae7b209662a317e4e520313a301bf23fa693aa5afb646b61d129","target":"graph","created_at":"2026-07-05T08:29:31Z","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/2406.05675/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a graph $H$, let $m(H,k)$ denote the number of vertices of degree $k$ in $H$. A conjecture of Alon and Wei states that for any $d\\geq 3$, every $n$-vertex $d$-regular graph contains a spanning subgraph $H$ satisfying $|m(H,k)-\\frac{n}{d+1}|\\leq 2$ for every $0\\leq k \\leq d$. This holds easily when $d\\leq 2$. An asymptotic version of this conjecture was initially established by Frieze, Gould, Karo\\'nski and Pfender, subsequently improved by Alon and Wei, and most recently enhanced by Fox, Luo and Pham, approaching its complete range. All of these approaches relied on probabilistic methods.\n","authors_text":"Jie Ma, Shengjie Xie","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-09T07:16:07Z","title":"Finding irregular subgraphs via local adjustments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05675","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:bd1a5b396f64badd5ce27edd4a8b539af243909600fbf9b7fa5b0a1b98fc9faf","target":"record","created_at":"2026-07-05T08:29:31Z","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":"f1789aa135689e80080e18425eea9ad10a9b552988a32b827876c9cd707a3c51","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-09T07:16:07Z","title_canon_sha256":"f5134e242571320be57f8933f6eef8f411a4fc8eb8034240f70b1ba4b815d8f8"},"schema_version":"1.0","source":{"id":"2406.05675","kind":"arxiv","version":1}},"canonical_sha256":"20532b7c12718ed192c25d7b2bb9d86d168837cb36088bb17a4092dd47b32588","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20532b7c12718ed192c25d7b2bb9d86d168837cb36088bb17a4092dd47b32588","first_computed_at":"2026-07-05T08:29:31.818478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:29:31.818478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2A6K0bbVLBjNf9vouXl/IwyvaXTmsO/ALSnUz25RdtrNOYx2KLGcXa2dskza8bJHLrCKCpYHiZFKoQf2MEOWDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:29:31.818970Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.05675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd1a5b396f64badd5ce27edd4a8b539af243909600fbf9b7fa5b0a1b98fc9faf","sha256:3bd15abd1fa1ae7b209662a317e4e520313a301bf23fa693aa5afb646b61d129"],"state_sha256":"8226b25483e317000a265a9ef78c716cd2dd863d614c9e639b013dbc4ec5418d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPwEs08ivUyMof9CHTZ4ESkhW3s/1otDIiyyApEtHaddqzciEQRbd7AEii17XkTE8ZM/RWHiQ7YOLMFUDsHuCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T10:21:54.679701Z","bundle_sha256":"9f16eddb46f2e3523fe828ab51ab406e5e39c5c7b64a07f7106f2b6a76f89388"}}