{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:RYN57J2XML5MAX4PN5HT2TNH2G","short_pith_number":"pith:RYN57J2X","canonical_record":{"source":{"id":"2206.08426","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2022-06-16T20:03:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"59c7ed4846c14565b6cf9bb9c116676d27f9130ca50c3e8179ae4c552f8b0a9e","abstract_canon_sha256":"7ad91a3768b21bcd618db41cbcfb24aefb86e1eeb5ea58fe7d49141b943bb17b"},"schema_version":"1.0"},"canonical_sha256":"8e1bdfa75762fac05f8f6f4f3d4da7d1b1091e14b9ae135ef78a84574673367f","source":{"kind":"arxiv","id":"2206.08426","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.08426","created_at":"2026-07-05T04:32:29Z"},{"alias_kind":"arxiv_version","alias_value":"2206.08426v1","created_at":"2026-07-05T04:32:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.08426","created_at":"2026-07-05T04:32:29Z"},{"alias_kind":"pith_short_12","alias_value":"RYN57J2XML5M","created_at":"2026-07-05T04:32:29Z"},{"alias_kind":"pith_short_16","alias_value":"RYN57J2XML5MAX4P","created_at":"2026-07-05T04:32:29Z"},{"alias_kind":"pith_short_8","alias_value":"RYN57J2X","created_at":"2026-07-05T04:32:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:RYN57J2XML5MAX4PN5HT2TNH2G","target":"record","payload":{"canonical_record":{"source":{"id":"2206.08426","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2022-06-16T20:03:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"59c7ed4846c14565b6cf9bb9c116676d27f9130ca50c3e8179ae4c552f8b0a9e","abstract_canon_sha256":"7ad91a3768b21bcd618db41cbcfb24aefb86e1eeb5ea58fe7d49141b943bb17b"},"schema_version":"1.0"},"canonical_sha256":"8e1bdfa75762fac05f8f6f4f3d4da7d1b1091e14b9ae135ef78a84574673367f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:29.538568Z","signature_b64":"8XhwYImfu3Ktu3jvQrEI/e8bZZZNoK00SCD/nUopVW6J3c52j5iSIRVEWdjNMJraYF5O8vcBiAUyEh1SOfaVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e1bdfa75762fac05f8f6f4f3d4da7d1b1091e14b9ae135ef78a84574673367f","last_reissued_at":"2026-07-05T04:32:29.538173Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:29.538173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.08426","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-05T04:32:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rE0A2i2Q4FBvBFXAzj6k9g1zdmLreSU2Dg3ZmFtj3gl3zGwDpXwMet02pGojNcnitq+e/Uq+pNtDtMsIl1b/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:12:28.967493Z"},"content_sha256":"399cc8480263f8003097372f24780ddfdc1dc3f5f36263d21a6ab4da39c4e45b","schema_version":"1.0","event_id":"sha256:399cc8480263f8003097372f24780ddfdc1dc3f5f36263d21a6ab4da39c4e45b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:RYN57J2XML5MAX4PN5HT2TNH2G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Felix Weilacher, Long Qian","submitted_at":"2022-06-16T20:03:08Z","abstract_excerpt":"We introduce new types of local algorithms, which we call \"ASI Algorithms\", and use them to demonstrate a link between descriptive and computable combinatorics. This allows us to unify arguments from the two fields, and also sometimes to port arguments from one field to the other. As an example, we generalize a computable combinatorics result of Kierstead and use it to get within one color of the Baire measurable analogue of Vizing's Theorem. We also improve Kierstead's result for multigraphs along the way."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.08426","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/2206.08426/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-05T04:32:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGaMdpr/MYNe4QFP1ffiATs6Eb914iV60O64yXJ4c4aM3zX2B1W7xkgEWY1aQHBJYztkQbtGOPfc7xYBZmh1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:12:28.968033Z"},"content_sha256":"f8624028388f0fb76c8eb962b1ed88b111148d9d29c0ff1b33d4db8b9cbb52c7","schema_version":"1.0","event_id":"sha256:f8624028388f0fb76c8eb962b1ed88b111148d9d29c0ff1b33d4db8b9cbb52c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYN57J2XML5MAX4PN5HT2TNH2G/bundle.json","state_url":"https://pith.science/pith/RYN57J2XML5MAX4PN5HT2TNH2G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYN57J2XML5MAX4PN5HT2TNH2G/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-17T12:12:28Z","links":{"resolver":"https://pith.science/pith/RYN57J2XML5MAX4PN5HT2TNH2G","bundle":"https://pith.science/pith/RYN57J2XML5MAX4PN5HT2TNH2G/bundle.json","state":"https://pith.science/pith/RYN57J2XML5MAX4PN5HT2TNH2G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYN57J2XML5MAX4PN5HT2TNH2G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RYN57J2XML5MAX4PN5HT2TNH2G","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":"7ad91a3768b21bcd618db41cbcfb24aefb86e1eeb5ea58fe7d49141b943bb17b","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2022-06-16T20:03:08Z","title_canon_sha256":"59c7ed4846c14565b6cf9bb9c116676d27f9130ca50c3e8179ae4c552f8b0a9e"},"schema_version":"1.0","source":{"id":"2206.08426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.08426","created_at":"2026-07-05T04:32:29Z"},{"alias_kind":"arxiv_version","alias_value":"2206.08426v1","created_at":"2026-07-05T04:32:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.08426","created_at":"2026-07-05T04:32:29Z"},{"alias_kind":"pith_short_12","alias_value":"RYN57J2XML5M","created_at":"2026-07-05T04:32:29Z"},{"alias_kind":"pith_short_16","alias_value":"RYN57J2XML5MAX4P","created_at":"2026-07-05T04:32:29Z"},{"alias_kind":"pith_short_8","alias_value":"RYN57J2X","created_at":"2026-07-05T04:32:29Z"}],"graph_snapshots":[{"event_id":"sha256:f8624028388f0fb76c8eb962b1ed88b111148d9d29c0ff1b33d4db8b9cbb52c7","target":"graph","created_at":"2026-07-05T04:32:29Z","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/2206.08426/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce new types of local algorithms, which we call \"ASI Algorithms\", and use them to demonstrate a link between descriptive and computable combinatorics. This allows us to unify arguments from the two fields, and also sometimes to port arguments from one field to the other. As an example, we generalize a computable combinatorics result of Kierstead and use it to get within one color of the Baire measurable analogue of Vizing's Theorem. We also improve Kierstead's result for multigraphs along the way.","authors_text":"Felix Weilacher, Long Qian","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2022-06-16T20:03:08Z","title":"Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.08426","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:399cc8480263f8003097372f24780ddfdc1dc3f5f36263d21a6ab4da39c4e45b","target":"record","created_at":"2026-07-05T04:32:29Z","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":"7ad91a3768b21bcd618db41cbcfb24aefb86e1eeb5ea58fe7d49141b943bb17b","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2022-06-16T20:03:08Z","title_canon_sha256":"59c7ed4846c14565b6cf9bb9c116676d27f9130ca50c3e8179ae4c552f8b0a9e"},"schema_version":"1.0","source":{"id":"2206.08426","kind":"arxiv","version":1}},"canonical_sha256":"8e1bdfa75762fac05f8f6f4f3d4da7d1b1091e14b9ae135ef78a84574673367f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e1bdfa75762fac05f8f6f4f3d4da7d1b1091e14b9ae135ef78a84574673367f","first_computed_at":"2026-07-05T04:32:29.538173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:32:29.538173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8XhwYImfu3Ktu3jvQrEI/e8bZZZNoK00SCD/nUopVW6J3c52j5iSIRVEWdjNMJraYF5O8vcBiAUyEh1SOfaVDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:32:29.538568Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.08426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:399cc8480263f8003097372f24780ddfdc1dc3f5f36263d21a6ab4da39c4e45b","sha256:f8624028388f0fb76c8eb962b1ed88b111148d9d29c0ff1b33d4db8b9cbb52c7"],"state_sha256":"deaa04642bcdcee8d8d03f3a37816b2c6456ee73d4d6cee58b5eaaec5ffd3fc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwGiLn4jYbQaqd8KjdrbK4rvioezHvrTz3XXaJZsORmjtukJ0TR5KoYoc5JUTwG3fHoM9uj30hKzqXrUGcnhBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T12:12:28.972638Z","bundle_sha256":"d42677e9938ad60b452dc75c8cfd280cc9d51a851df31034d1df656d90542cb9"}}