{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IKGBTURPLQVMXOOY6MJZLDUUXA","short_pith_number":"pith:IKGBTURP","canonical_record":{"source":{"id":"2606.10693","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-09T10:52:42Z","cross_cats_sorted":["cs.CC","cs.FL"],"title_canon_sha256":"09d1055e884040e18d6e13baaea88e3455eb120c599c74846f5b4cb58338d2f3","abstract_canon_sha256":"0269e7ed5c937659e09af976163ccdbf086a9e1c0ed1094d186d10c274f76553"},"schema_version":"1.0"},"canonical_sha256":"428c19d22f5c2acbb9d8f313958e94b809bcdf6037a173d920ddd881407c27a7","source":{"kind":"arxiv","id":"2606.10693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10693","created_at":"2026-06-10T01:10:34Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10693v1","created_at":"2026-06-10T01:10:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10693","created_at":"2026-06-10T01:10:34Z"},{"alias_kind":"pith_short_12","alias_value":"IKGBTURPLQVM","created_at":"2026-06-10T01:10:34Z"},{"alias_kind":"pith_short_16","alias_value":"IKGBTURPLQVMXOOY","created_at":"2026-06-10T01:10:34Z"},{"alias_kind":"pith_short_8","alias_value":"IKGBTURP","created_at":"2026-06-10T01:10:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IKGBTURPLQVMXOOY6MJZLDUUXA","target":"record","payload":{"canonical_record":{"source":{"id":"2606.10693","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-09T10:52:42Z","cross_cats_sorted":["cs.CC","cs.FL"],"title_canon_sha256":"09d1055e884040e18d6e13baaea88e3455eb120c599c74846f5b4cb58338d2f3","abstract_canon_sha256":"0269e7ed5c937659e09af976163ccdbf086a9e1c0ed1094d186d10c274f76553"},"schema_version":"1.0"},"canonical_sha256":"428c19d22f5c2acbb9d8f313958e94b809bcdf6037a173d920ddd881407c27a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:10:34.609416Z","signature_b64":"MEhyqn2x05H630+wUyjbWIaQ6k6MezF7LyDjllsuNW03zSve5tPMOVpXODgJZC9w1w+BJWqF0EgTu6ofinYjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428c19d22f5c2acbb9d8f313958e94b809bcdf6037a173d920ddd881407c27a7","last_reissued_at":"2026-06-10T01:10:34.608680Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:10:34.608680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.10693","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-06-10T01:10:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uYCI4iPAicny8Jm7HXAcp2Ex6tPXxl7UT2hJEdDrWClyoxB+0NDwZRPnvK/yx0rXUXRuqsOeqJSIErx4hzGADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:27:16.631914Z"},"content_sha256":"f97ac474fade7bd37c7efdcae3833a98ca7ad88384289a83ee30d214002be1f0","schema_version":"1.0","event_id":"sha256:f97ac474fade7bd37c7efdcae3833a98ca7ad88384289a83ee30d214002be1f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IKGBTURPLQVMXOOY6MJZLDUUXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC","cs.FL"],"primary_cat":"cs.DC","authors_text":"Chiara Piombi","submitted_at":"2026-06-09T10:52:42Z","abstract_excerpt":"The last decade of research on the LOCAL model has seen tremendous progress in understanding locally checkable labeling (LCL) problems, culminating in an almost complete classification of the possible complexities LCL problems can exhibit. In particular, on undirected trees, Chang and Pettie showed that there is no LCL problem with complexity between $\\omega(\\log n)$ and $n^{o(1)}$ and Chang showed that, for every positive integer $k$, there is no LCL problem with complexity between $\\omega(n^{1/(k+1)})$ and $o(n^{1/k})$; additionally, which side of each gap a problem is found on is decidable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10693","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/2606.10693/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-06-10T01:10:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iytC4q6OgaZp25M+UrEIvHZbLDK6IEYthqNazjQ9YIuh4Jc8xxejvlT8kEtUIhDyVgFzu/tCp/C9zRmgCb/YAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:27:16.632297Z"},"content_sha256":"3c442fe7fd348557cec2a65e00722f1def95c42fbdef6698d67887a0ee234193","schema_version":"1.0","event_id":"sha256:3c442fe7fd348557cec2a65e00722f1def95c42fbdef6698d67887a0ee234193"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKGBTURPLQVMXOOY6MJZLDUUXA/bundle.json","state_url":"https://pith.science/pith/IKGBTURPLQVMXOOY6MJZLDUUXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKGBTURPLQVMXOOY6MJZLDUUXA/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-06-30T07:27:16Z","links":{"resolver":"https://pith.science/pith/IKGBTURPLQVMXOOY6MJZLDUUXA","bundle":"https://pith.science/pith/IKGBTURPLQVMXOOY6MJZLDUUXA/bundle.json","state":"https://pith.science/pith/IKGBTURPLQVMXOOY6MJZLDUUXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKGBTURPLQVMXOOY6MJZLDUUXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IKGBTURPLQVMXOOY6MJZLDUUXA","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":"0269e7ed5c937659e09af976163ccdbf086a9e1c0ed1094d186d10c274f76553","cross_cats_sorted":["cs.CC","cs.FL"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-09T10:52:42Z","title_canon_sha256":"09d1055e884040e18d6e13baaea88e3455eb120c599c74846f5b4cb58338d2f3"},"schema_version":"1.0","source":{"id":"2606.10693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10693","created_at":"2026-06-10T01:10:34Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10693v1","created_at":"2026-06-10T01:10:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10693","created_at":"2026-06-10T01:10:34Z"},{"alias_kind":"pith_short_12","alias_value":"IKGBTURPLQVM","created_at":"2026-06-10T01:10:34Z"},{"alias_kind":"pith_short_16","alias_value":"IKGBTURPLQVMXOOY","created_at":"2026-06-10T01:10:34Z"},{"alias_kind":"pith_short_8","alias_value":"IKGBTURP","created_at":"2026-06-10T01:10:34Z"}],"graph_snapshots":[{"event_id":"sha256:3c442fe7fd348557cec2a65e00722f1def95c42fbdef6698d67887a0ee234193","target":"graph","created_at":"2026-06-10T01:10:34Z","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/2606.10693/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The last decade of research on the LOCAL model has seen tremendous progress in understanding locally checkable labeling (LCL) problems, culminating in an almost complete classification of the possible complexities LCL problems can exhibit. In particular, on undirected trees, Chang and Pettie showed that there is no LCL problem with complexity between $\\omega(\\log n)$ and $n^{o(1)}$ and Chang showed that, for every positive integer $k$, there is no LCL problem with complexity between $\\omega(n^{1/(k+1)})$ and $o(n^{1/k})$; additionally, which side of each gap a problem is found on is decidable.","authors_text":"Chiara Piombi","cross_cats":["cs.CC","cs.FL"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-09T10:52:42Z","title":"Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10693","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:f97ac474fade7bd37c7efdcae3833a98ca7ad88384289a83ee30d214002be1f0","target":"record","created_at":"2026-06-10T01:10:34Z","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":"0269e7ed5c937659e09af976163ccdbf086a9e1c0ed1094d186d10c274f76553","cross_cats_sorted":["cs.CC","cs.FL"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-09T10:52:42Z","title_canon_sha256":"09d1055e884040e18d6e13baaea88e3455eb120c599c74846f5b4cb58338d2f3"},"schema_version":"1.0","source":{"id":"2606.10693","kind":"arxiv","version":1}},"canonical_sha256":"428c19d22f5c2acbb9d8f313958e94b809bcdf6037a173d920ddd881407c27a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"428c19d22f5c2acbb9d8f313958e94b809bcdf6037a173d920ddd881407c27a7","first_computed_at":"2026-06-10T01:10:34.608680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:10:34.608680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MEhyqn2x05H630+wUyjbWIaQ6k6MezF7LyDjllsuNW03zSve5tPMOVpXODgJZC9w1w+BJWqF0EgTu6ofinYjBw==","signature_status":"signed_v1","signed_at":"2026-06-10T01:10:34.609416Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.10693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f97ac474fade7bd37c7efdcae3833a98ca7ad88384289a83ee30d214002be1f0","sha256:3c442fe7fd348557cec2a65e00722f1def95c42fbdef6698d67887a0ee234193"],"state_sha256":"2d2e461849b9623c7c1a0c25489b8d4b243c5994b968e4f45781ddbe29d7b963"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qri3iE0uiN3f6ryg+UCUO9hjIk2cbQLuQLY9JXeTFfvaVh4KaSFouZbstAlpe/mmZOF23Jj8O3pZsq6IB2kIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T07:27:16.634486Z","bundle_sha256":"76f7bf91defa00047706f7efa378065416d5a0376ae48e889efaf5f541453ce5"}}