{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:6LOI2Y2HU5YGGHNN6XCN2UB5JQ","short_pith_number":"pith:6LOI2Y2H","canonical_record":{"source":{"id":"cs/0503034","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2005-03-16T11:09:06Z","cross_cats_sorted":[],"title_canon_sha256":"cb5df4e2935523ddf7a43571349042baa8088daaa7601f33a74f8f99060a62fe","abstract_canon_sha256":"fc02f5ffe8bfb0ece59c2edbcee4e82a5fdbbeeb44982a2bd6c7d81ded83c94b"},"schema_version":"1.0"},"canonical_sha256":"f2dc8d6347a770631dadf5c4dd503d4c2211733d550cfe9e2516a5a1eb216798","source":{"kind":"arxiv","id":"cs/0503034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0503034","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0503034v1","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0503034","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"6LOI2Y2HU5YG","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"6LOI2Y2HU5YGGHNN","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"6LOI2Y2H","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:6LOI2Y2HU5YGGHNN6XCN2UB5JQ","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0503034","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2005-03-16T11:09:06Z","cross_cats_sorted":[],"title_canon_sha256":"cb5df4e2935523ddf7a43571349042baa8088daaa7601f33a74f8f99060a62fe","abstract_canon_sha256":"fc02f5ffe8bfb0ece59c2edbcee4e82a5fdbbeeb44982a2bd6c7d81ded83c94b"},"schema_version":"1.0"},"canonical_sha256":"f2dc8d6347a770631dadf5c4dd503d4c2211733d550cfe9e2516a5a1eb216798","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:54.195239Z","signature_b64":"Eg+i1kfghyMY4fVXjk4PwCi6brGoE5yTr8ysNMdHjeHgC3tqMGDjOrv6YL6LwwWTFtkNJGjn2trmJgUMZA58Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2dc8d6347a770631dadf5c4dd503d4c2211733d550cfe9e2516a5a1eb216798","last_reissued_at":"2026-05-18T04:08:54.194774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:54.194774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0503034","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-05-18T04:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YGSuNVEwdrUeN6KAO0LIRQre/Gyy/wfZ/uEoCYoAaCVBsN4R6U0c6wYXE7Q8XGRtWqu13XYJPdJbA3IIFBEyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:24:00.478633Z"},"content_sha256":"fdcaec6679eda2534a5e168fad9e6e981492bb486d4b0ef74f2ecff65985dcee","schema_version":"1.0","event_id":"sha256:fdcaec6679eda2534a5e168fad9e6e981492bb486d4b0ef74f2ecff65985dcee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:6LOI2Y2HU5YGGHNN6XCN2UB5JQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comment on \"Some non-conventional ideas about algorithmic complexity\"","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Poulin, Hugo Touchette","submitted_at":"2005-03-16T11:09:06Z","abstract_excerpt":"We comment on a recent paper by D'Abramo [Chaos, Solitons & Fractals, 25 (2005) 29], focusing on the author's statement that an algorithm can produce a list of strings containing at least one string whose algorithmic complexity is greater than that of the entire list. We show that this statement, although perplexing, is not as paradoxical as it seems when the definition of algorithmic complexity is applied correctly."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0503034","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":""},"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-05-18T04:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3R7lNhBLXEVPt5Ad4cTmKbFvIs7fhyLVu82/G3xQ2bm8/OdxeOh15ZBpiIyXcBbv5CIjq4SZnnTdkAPDKbJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:24:00.479280Z"},"content_sha256":"6b226b54e10068206b63d62cf4d22b0060af10833aa9e433a57470df52501817","schema_version":"1.0","event_id":"sha256:6b226b54e10068206b63d62cf4d22b0060af10833aa9e433a57470df52501817"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LOI2Y2HU5YGGHNN6XCN2UB5JQ/bundle.json","state_url":"https://pith.science/pith/6LOI2Y2HU5YGGHNN6XCN2UB5JQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LOI2Y2HU5YGGHNN6XCN2UB5JQ/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-08T17:24:00Z","links":{"resolver":"https://pith.science/pith/6LOI2Y2HU5YGGHNN6XCN2UB5JQ","bundle":"https://pith.science/pith/6LOI2Y2HU5YGGHNN6XCN2UB5JQ/bundle.json","state":"https://pith.science/pith/6LOI2Y2HU5YGGHNN6XCN2UB5JQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LOI2Y2HU5YGGHNN6XCN2UB5JQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:6LOI2Y2HU5YGGHNN6XCN2UB5JQ","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":"fc02f5ffe8bfb0ece59c2edbcee4e82a5fdbbeeb44982a2bd6c7d81ded83c94b","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2005-03-16T11:09:06Z","title_canon_sha256":"cb5df4e2935523ddf7a43571349042baa8088daaa7601f33a74f8f99060a62fe"},"schema_version":"1.0","source":{"id":"cs/0503034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0503034","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0503034v1","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0503034","created_at":"2026-05-18T04:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"6LOI2Y2HU5YG","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"6LOI2Y2HU5YGGHNN","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"6LOI2Y2H","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:6b226b54e10068206b63d62cf4d22b0060af10833aa9e433a57470df52501817","target":"graph","created_at":"2026-05-18T04:08:54Z","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"},"paper":{"abstract_excerpt":"We comment on a recent paper by D'Abramo [Chaos, Solitons & Fractals, 25 (2005) 29], focusing on the author's statement that an algorithm can produce a list of strings containing at least one string whose algorithmic complexity is greater than that of the entire list. We show that this statement, although perplexing, is not as paradoxical as it seems when the definition of algorithmic complexity is applied correctly.","authors_text":"David Poulin, Hugo Touchette","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2005-03-16T11:09:06Z","title":"Comment on \"Some non-conventional ideas about algorithmic complexity\""},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0503034","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:fdcaec6679eda2534a5e168fad9e6e981492bb486d4b0ef74f2ecff65985dcee","target":"record","created_at":"2026-05-18T04:08:54Z","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":"fc02f5ffe8bfb0ece59c2edbcee4e82a5fdbbeeb44982a2bd6c7d81ded83c94b","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2005-03-16T11:09:06Z","title_canon_sha256":"cb5df4e2935523ddf7a43571349042baa8088daaa7601f33a74f8f99060a62fe"},"schema_version":"1.0","source":{"id":"cs/0503034","kind":"arxiv","version":1}},"canonical_sha256":"f2dc8d6347a770631dadf5c4dd503d4c2211733d550cfe9e2516a5a1eb216798","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2dc8d6347a770631dadf5c4dd503d4c2211733d550cfe9e2516a5a1eb216798","first_computed_at":"2026-05-18T04:08:54.194774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:54.194774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eg+i1kfghyMY4fVXjk4PwCi6brGoE5yTr8ysNMdHjeHgC3tqMGDjOrv6YL6LwwWTFtkNJGjn2trmJgUMZA58Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:54.195239Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0503034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdcaec6679eda2534a5e168fad9e6e981492bb486d4b0ef74f2ecff65985dcee","sha256:6b226b54e10068206b63d62cf4d22b0060af10833aa9e433a57470df52501817"],"state_sha256":"c0e67ed080743f6ad0a65d241b6b391638a49d8c7403633a709d652eeb634e95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnKlX2WoFbJdS8TOEBXpEBJ3uD5S08BPidxDkdA94ercGwIHdzutyusET9GvM/M20JCxE0wVoOc/2zpL/7cPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:24:00.482406Z","bundle_sha256":"6ad254e90df761a3fc202212675dfd7a251be1b17b403af7a78312527c6c623a"}}