{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:J54BTKMHP2V2JZZYAICTSMOA6K","short_pith_number":"pith:J54BTKMH","canonical_record":{"source":{"id":"1012.3548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-16T10:07:39Z","cross_cats_sorted":[],"title_canon_sha256":"0f7845a74d28e75bf8726728a3f1b161fb5fba549491bd151ed55781f5d989e4","abstract_canon_sha256":"f92d9cb566bf155f32901c3c5fcd1a5b8c17974c5108396d74ea0d78bcd7286d"},"schema_version":"1.0"},"canonical_sha256":"4f7819a9877eaba4e73802053931c0f2bef6d358d726468e8d979f57a8027ca2","source":{"kind":"arxiv","id":"1012.3548","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3548","created_at":"2026-05-18T02:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3548v2","created_at":"2026-05-18T02:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3548","created_at":"2026-05-18T02:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"J54BTKMHP2V2","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"J54BTKMHP2V2JZZY","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"J54BTKMH","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:J54BTKMHP2V2JZZYAICTSMOA6K","target":"record","payload":{"canonical_record":{"source":{"id":"1012.3548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-16T10:07:39Z","cross_cats_sorted":[],"title_canon_sha256":"0f7845a74d28e75bf8726728a3f1b161fb5fba549491bd151ed55781f5d989e4","abstract_canon_sha256":"f92d9cb566bf155f32901c3c5fcd1a5b8c17974c5108396d74ea0d78bcd7286d"},"schema_version":"1.0"},"canonical_sha256":"4f7819a9877eaba4e73802053931c0f2bef6d358d726468e8d979f57a8027ca2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:07.076096Z","signature_b64":"6XYsWwAMk1SqaYpVEjhcts1YCY9HORA9mr5PiAc7ywFfMS580zxwMpmD8MFzzcszyHCnDj01UlT3/bRejvpkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f7819a9877eaba4e73802053931c0f2bef6d358d726468e8d979f57a8027ca2","last_reissued_at":"2026-05-18T02:23:07.075364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:07.075364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.3548","source_version":2,"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-18T02:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wtl+KDuujzi7iwrobs9Zj9no7Q+tvP8sWB0D70Xh+/fDE/o50B6AwWX5JwAi/F1cPRcfWmcwuOd0zJ8SBpWDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:57:59.283921Z"},"content_sha256":"35ca7e023916ad47604ea94d9a43ecdd6aeda23ad61edb44be2fb96d8e52f590","schema_version":"1.0","event_id":"sha256:35ca7e023916ad47604ea94d9a43ecdd6aeda23ad61edb44be2fb96d8e52f590"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:J54BTKMHP2V2JZZYAICTSMOA6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the polynomial depth of various sets of random strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Philippe Moser","submitted_at":"2010-12-16T10:07:39Z","abstract_excerpt":"This paper proposes new notions of polynomial depth (called monotone poly depth), based on a polynomial version of monotone Kolmogorov complexity. We show that monotone poly depth satisfies all desirable properties of depth notions i.e., both trivial and random sequences are not monotone poly deep, monotone poly depth satisfies the slow growth law i.e., no simple process can transform a non deep sequence into a deep one, and monotone poly deep sequences exist (unconditionally). We give two natural examples of deep sets, by showing that both the set of Levin-random strings and the set of Kolmog"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3548","kind":"arxiv","version":2},"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-18T02:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOgkkUxJxAAQ2TA22g4jkFhsYIJi4SwqyxFnCIB5obTsB9TF+BGs43XPgzPSEQe1iSZRAKtf3T8Sr61GehrzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:57:59.284261Z"},"content_sha256":"b5f2393f805af6b07d298eab28673cd0ed6bcc4bdd9dce17a39a9b27454b56b6","schema_version":"1.0","event_id":"sha256:b5f2393f805af6b07d298eab28673cd0ed6bcc4bdd9dce17a39a9b27454b56b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J54BTKMHP2V2JZZYAICTSMOA6K/bundle.json","state_url":"https://pith.science/pith/J54BTKMHP2V2JZZYAICTSMOA6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J54BTKMHP2V2JZZYAICTSMOA6K/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-25T06:57:59Z","links":{"resolver":"https://pith.science/pith/J54BTKMHP2V2JZZYAICTSMOA6K","bundle":"https://pith.science/pith/J54BTKMHP2V2JZZYAICTSMOA6K/bundle.json","state":"https://pith.science/pith/J54BTKMHP2V2JZZYAICTSMOA6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J54BTKMHP2V2JZZYAICTSMOA6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:J54BTKMHP2V2JZZYAICTSMOA6K","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":"f92d9cb566bf155f32901c3c5fcd1a5b8c17974c5108396d74ea0d78bcd7286d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-16T10:07:39Z","title_canon_sha256":"0f7845a74d28e75bf8726728a3f1b161fb5fba549491bd151ed55781f5d989e4"},"schema_version":"1.0","source":{"id":"1012.3548","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3548","created_at":"2026-05-18T02:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3548v2","created_at":"2026-05-18T02:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3548","created_at":"2026-05-18T02:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"J54BTKMHP2V2","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"J54BTKMHP2V2JZZY","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"J54BTKMH","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:b5f2393f805af6b07d298eab28673cd0ed6bcc4bdd9dce17a39a9b27454b56b6","target":"graph","created_at":"2026-05-18T02:23:07Z","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":"This paper proposes new notions of polynomial depth (called monotone poly depth), based on a polynomial version of monotone Kolmogorov complexity. We show that monotone poly depth satisfies all desirable properties of depth notions i.e., both trivial and random sequences are not monotone poly deep, monotone poly depth satisfies the slow growth law i.e., no simple process can transform a non deep sequence into a deep one, and monotone poly deep sequences exist (unconditionally). We give two natural examples of deep sets, by showing that both the set of Levin-random strings and the set of Kolmog","authors_text":"Philippe Moser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-16T10:07:39Z","title":"On the polynomial depth of various sets of random strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3548","kind":"arxiv","version":2},"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:35ca7e023916ad47604ea94d9a43ecdd6aeda23ad61edb44be2fb96d8e52f590","target":"record","created_at":"2026-05-18T02:23:07Z","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":"f92d9cb566bf155f32901c3c5fcd1a5b8c17974c5108396d74ea0d78bcd7286d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-16T10:07:39Z","title_canon_sha256":"0f7845a74d28e75bf8726728a3f1b161fb5fba549491bd151ed55781f5d989e4"},"schema_version":"1.0","source":{"id":"1012.3548","kind":"arxiv","version":2}},"canonical_sha256":"4f7819a9877eaba4e73802053931c0f2bef6d358d726468e8d979f57a8027ca2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f7819a9877eaba4e73802053931c0f2bef6d358d726468e8d979f57a8027ca2","first_computed_at":"2026-05-18T02:23:07.075364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:07.075364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6XYsWwAMk1SqaYpVEjhcts1YCY9HORA9mr5PiAc7ywFfMS580zxwMpmD8MFzzcszyHCnDj01UlT3/bRejvpkAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:07.076096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.3548","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35ca7e023916ad47604ea94d9a43ecdd6aeda23ad61edb44be2fb96d8e52f590","sha256:b5f2393f805af6b07d298eab28673cd0ed6bcc4bdd9dce17a39a9b27454b56b6"],"state_sha256":"1669ad6aed93c7aabeedde317eec97b7254cbd917381f4c31006f4dbde10256a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KsUJfJ3KKWlGNpmxyY8RT6l6jg3DngkWicn+jCAEN3xI17uY0gA7QMUHHCfKWluumloq+wqtcyaQ8ZbE95uUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T06:57:59.286701Z","bundle_sha256":"f547cf0a809c4f3d1635bc31fea513b38aae93b2f27204c47bf487ca767dc2c0"}}