{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VLEZMVFQQHAWSNJHRE2COOFPSM","short_pith_number":"pith:VLEZMVFQ","canonical_record":{"source":{"id":"2606.04257","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-02T22:18:38Z","cross_cats_sorted":[],"title_canon_sha256":"4b587ceebc52572b78a17684eaf0f5ce46572127fcee60a780958bcd1161867c","abstract_canon_sha256":"679166f1dbbc93e2c957cc2ec701a6e0f6f666431d23d12caf4e7a010f5dd8f8"},"schema_version":"1.0"},"canonical_sha256":"aac99654b081c169352789342738af9338748fbd05901ea7c09d5cf666cb2211","source":{"kind":"arxiv","id":"2606.04257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04257","created_at":"2026-06-04T01:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04257v1","created_at":"2026-06-04T01:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04257","created_at":"2026-06-04T01:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"VLEZMVFQQHAW","created_at":"2026-06-04T01:09:00Z"},{"alias_kind":"pith_short_16","alias_value":"VLEZMVFQQHAWSNJH","created_at":"2026-06-04T01:09:00Z"},{"alias_kind":"pith_short_8","alias_value":"VLEZMVFQ","created_at":"2026-06-04T01:09:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VLEZMVFQQHAWSNJHRE2COOFPSM","target":"record","payload":{"canonical_record":{"source":{"id":"2606.04257","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-02T22:18:38Z","cross_cats_sorted":[],"title_canon_sha256":"4b587ceebc52572b78a17684eaf0f5ce46572127fcee60a780958bcd1161867c","abstract_canon_sha256":"679166f1dbbc93e2c957cc2ec701a6e0f6f666431d23d12caf4e7a010f5dd8f8"},"schema_version":"1.0"},"canonical_sha256":"aac99654b081c169352789342738af9338748fbd05901ea7c09d5cf666cb2211","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:00.649054Z","signature_b64":"TSyk2Gj+IJlEstVR2YkUQ9b1HGBgqzHdlNliHGqWtbtLB0780gkC/Ncw7hK/HlUXdZldy89J7+hEIuGef7B7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aac99654b081c169352789342738af9338748fbd05901ea7c09d5cf666cb2211","last_reissued_at":"2026-06-04T01:09:00.648556Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:00.648556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.04257","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-04T01:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uefPUP8xsD04A2+qkZ89HDMyhUHUM77WFlgFnRtTeNtBJPK+t6TbNMjDxF7SWx8UOzehwuYaLFIWxy24xN6oDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:38:56.891513Z"},"content_sha256":"63a4568d44505e762ca299f3d813e6d37f0cb26a8ea9ab0ee61ffc744d585332","schema_version":"1.0","event_id":"sha256:63a4568d44505e762ca299f3d813e6d37f0cb26a8ea9ab0ee61ffc744d585332"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VLEZMVFQQHAWSNJHRE2COOFPSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hunter Monroe","submitted_at":"2026-06-02T22:18:38Z","abstract_excerpt":"Monroe (2026) shows that the nonexistence of an optimal proof system can be read as an information constraint regarding canonical hard instances: no sound arithmetic theory simulates the extensions adjoining sufficiently large, unprovable Busy Beaver values. Furthermore, if the best-known route to simulation is also necessary -- that is, if simulation requires a relative-consistency explanation over a weak base theory -- then the same constraint holds for inaccessible Kolmogorov-randomness facts. Call this Kolmogorov Hardness (KH).\n  We argue that open questions in computational complexity can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04257","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.04257/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-04T01:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uGFXILWZIUZXNHwuKtCBZpS9VQXpPCRCC3eXhs4gV4Z/uowuUGu4Y1cWPwwgX64CrS1ztIhd57Rbe3zZkK/dAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:38:56.892283Z"},"content_sha256":"f1383356e471c90293a7d51ba0137e99ddf3953f5323c1293bae2593f2e44743","schema_version":"1.0","event_id":"sha256:f1383356e471c90293a7d51ba0137e99ddf3953f5323c1293bae2593f2e44743"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLEZMVFQQHAWSNJHRE2COOFPSM/bundle.json","state_url":"https://pith.science/pith/VLEZMVFQQHAWSNJHRE2COOFPSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLEZMVFQQHAWSNJHRE2COOFPSM/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-11T00:38:56Z","links":{"resolver":"https://pith.science/pith/VLEZMVFQQHAWSNJHRE2COOFPSM","bundle":"https://pith.science/pith/VLEZMVFQQHAWSNJHRE2COOFPSM/bundle.json","state":"https://pith.science/pith/VLEZMVFQQHAWSNJHRE2COOFPSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLEZMVFQQHAWSNJHRE2COOFPSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VLEZMVFQQHAWSNJHRE2COOFPSM","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":"679166f1dbbc93e2c957cc2ec701a6e0f6f666431d23d12caf4e7a010f5dd8f8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-02T22:18:38Z","title_canon_sha256":"4b587ceebc52572b78a17684eaf0f5ce46572127fcee60a780958bcd1161867c"},"schema_version":"1.0","source":{"id":"2606.04257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04257","created_at":"2026-06-04T01:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04257v1","created_at":"2026-06-04T01:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04257","created_at":"2026-06-04T01:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"VLEZMVFQQHAW","created_at":"2026-06-04T01:09:00Z"},{"alias_kind":"pith_short_16","alias_value":"VLEZMVFQQHAWSNJH","created_at":"2026-06-04T01:09:00Z"},{"alias_kind":"pith_short_8","alias_value":"VLEZMVFQ","created_at":"2026-06-04T01:09:00Z"}],"graph_snapshots":[{"event_id":"sha256:f1383356e471c90293a7d51ba0137e99ddf3953f5323c1293bae2593f2e44743","target":"graph","created_at":"2026-06-04T01:09:00Z","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.04257/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Monroe (2026) shows that the nonexistence of an optimal proof system can be read as an information constraint regarding canonical hard instances: no sound arithmetic theory simulates the extensions adjoining sufficiently large, unprovable Busy Beaver values. Furthermore, if the best-known route to simulation is also necessary -- that is, if simulation requires a relative-consistency explanation over a weak base theory -- then the same constraint holds for inaccessible Kolmogorov-randomness facts. Call this Kolmogorov Hardness (KH).\n  We argue that open questions in computational complexity can","authors_text":"Hunter Monroe","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04257","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:63a4568d44505e762ca299f3d813e6d37f0cb26a8ea9ab0ee61ffc744d585332","target":"record","created_at":"2026-06-04T01:09:00Z","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":"679166f1dbbc93e2c957cc2ec701a6e0f6f666431d23d12caf4e7a010f5dd8f8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-02T22:18:38Z","title_canon_sha256":"4b587ceebc52572b78a17684eaf0f5ce46572127fcee60a780958bcd1161867c"},"schema_version":"1.0","source":{"id":"2606.04257","kind":"arxiv","version":1}},"canonical_sha256":"aac99654b081c169352789342738af9338748fbd05901ea7c09d5cf666cb2211","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aac99654b081c169352789342738af9338748fbd05901ea7c09d5cf666cb2211","first_computed_at":"2026-06-04T01:09:00.648556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:09:00.648556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TSyk2Gj+IJlEstVR2YkUQ9b1HGBgqzHdlNliHGqWtbtLB0780gkC/Ncw7hK/HlUXdZldy89J7+hEIuGef7B7Dg==","signature_status":"signed_v1","signed_at":"2026-06-04T01:09:00.649054Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.04257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63a4568d44505e762ca299f3d813e6d37f0cb26a8ea9ab0ee61ffc744d585332","sha256:f1383356e471c90293a7d51ba0137e99ddf3953f5323c1293bae2593f2e44743"],"state_sha256":"e0078643381d7dcf84f1171a3d22ab68237586bb618a853a642a935e5bb0b605"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DJIH0rkhJp/a7ZvIoLu97o1RR07dsK8YZNNEkWzFvjKAq8lko5ITrYM5epvQV6klETuxeIglvSSpszGiyALZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:38:56.896497Z","bundle_sha256":"83c89cac3e548b0f527d0cfc3d91b097467eb7874406778e6f438c34323d7b46"}}