{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2YZTJLLFFGX2QVWHCERZDI42FN","short_pith_number":"pith:2YZTJLLF","canonical_record":{"source":{"id":"1301.4211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2013-01-17T20:38:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4bc413c8ce1aed06fabf6bb802316330cf321aad311ae90b5c7e9e29e8eb85c9","abstract_canon_sha256":"45349978f27b2033954d25affc730d5d382bdc91611fc2278f791bde7312ca3b"},"schema_version":"1.0"},"canonical_sha256":"d63334ad6529afa856c7112391a39a2b6c53c591b37d774ee62af46e48ecc369","source":{"kind":"arxiv","id":"1301.4211","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4211","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4211v1","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4211","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"2YZTJLLFFGX2","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2YZTJLLFFGX2QVWH","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2YZTJLLF","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2YZTJLLFFGX2QVWHCERZDI42FN","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2013-01-17T20:38:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4bc413c8ce1aed06fabf6bb802316330cf321aad311ae90b5c7e9e29e8eb85c9","abstract_canon_sha256":"45349978f27b2033954d25affc730d5d382bdc91611fc2278f791bde7312ca3b"},"schema_version":"1.0"},"canonical_sha256":"d63334ad6529afa856c7112391a39a2b6c53c591b37d774ee62af46e48ecc369","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:06.899494Z","signature_b64":"GMqpmi3cAXGpsYGK0WKfOVTVI700TB95bcLk1liucy42cK2z7v/JgEdj9vY7/GLHpP/w3EE02qffFfKUtOIMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d63334ad6529afa856c7112391a39a2b6c53c591b37d774ee62af46e48ecc369","last_reissued_at":"2026-05-18T03:36:06.898781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:06.898781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4211","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-18T03:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LMdjqeDmpRFGAnxcSYSH5JDddb9axHugArcMQGNQaMFSwGBvjVaMccnsuRZWepc19/HYdXFWlG06kEjQ30kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:35:08.193088Z"},"content_sha256":"688aac8c1459bc7b5a2b4732e03eaef5624a42f9b554577bedeafaab87ca3db9","schema_version":"1.0","event_id":"sha256:688aac8c1459bc7b5a2b4732e03eaef5624a42f9b554577bedeafaab87ca3db9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2YZTJLLFFGX2QVWHCERZDI42FN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-related complexity: a problem-oriented approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"physics.data-an","authors_text":"David Grace, Eugene Perevalov","submitted_at":"2013-01-17T20:38:04Z","abstract_excerpt":"A general notion of information-related complexity applicable to both natural and man-made systems is proposed. The overall approach is to explicitly consider a rational agent performing a certain task with a quantifiable degree of success. The complexity is defined as the minimum (quasi-)quantity of information that's necessary to complete the task to the given extent -- measured by the corresponding loss. The complexity so defined is shown to generalize the existing notion of statistical complexity when the system in question can be described by a discrete-time stochastic process. The propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4211","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-18T03:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U9UuMWrj7a3seirJZIVvh6GT6FFBMeVfyNkMnBQBix1BhOQkPKklZQKAhn4Hu0KDPaVvyl3O/ahTx8XLbRscDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:35:08.193846Z"},"content_sha256":"65e2bfe0afee2af123037793fd6d4ea407130bd874027f2cd5f0d63a8fd2a613","schema_version":"1.0","event_id":"sha256:65e2bfe0afee2af123037793fd6d4ea407130bd874027f2cd5f0d63a8fd2a613"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN/bundle.json","state_url":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YZTJLLFFGX2QVWHCERZDI42FN/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-11T15:35:08Z","links":{"resolver":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN","bundle":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN/bundle.json","state":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YZTJLLFFGX2QVWHCERZDI42FN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2YZTJLLFFGX2QVWHCERZDI42FN","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":"45349978f27b2033954d25affc730d5d382bdc91611fc2278f791bde7312ca3b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2013-01-17T20:38:04Z","title_canon_sha256":"4bc413c8ce1aed06fabf6bb802316330cf321aad311ae90b5c7e9e29e8eb85c9"},"schema_version":"1.0","source":{"id":"1301.4211","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4211","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4211v1","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4211","created_at":"2026-05-18T03:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"2YZTJLLFFGX2","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2YZTJLLFFGX2QVWH","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2YZTJLLF","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:65e2bfe0afee2af123037793fd6d4ea407130bd874027f2cd5f0d63a8fd2a613","target":"graph","created_at":"2026-05-18T03:36:06Z","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":"A general notion of information-related complexity applicable to both natural and man-made systems is proposed. The overall approach is to explicitly consider a rational agent performing a certain task with a quantifiable degree of success. The complexity is defined as the minimum (quasi-)quantity of information that's necessary to complete the task to the given extent -- measured by the corresponding loss. The complexity so defined is shown to generalize the existing notion of statistical complexity when the system in question can be described by a discrete-time stochastic process. The propos","authors_text":"David Grace, Eugene Perevalov","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2013-01-17T20:38:04Z","title":"Information-related complexity: a problem-oriented approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4211","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:688aac8c1459bc7b5a2b4732e03eaef5624a42f9b554577bedeafaab87ca3db9","target":"record","created_at":"2026-05-18T03:36:06Z","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":"45349978f27b2033954d25affc730d5d382bdc91611fc2278f791bde7312ca3b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2013-01-17T20:38:04Z","title_canon_sha256":"4bc413c8ce1aed06fabf6bb802316330cf321aad311ae90b5c7e9e29e8eb85c9"},"schema_version":"1.0","source":{"id":"1301.4211","kind":"arxiv","version":1}},"canonical_sha256":"d63334ad6529afa856c7112391a39a2b6c53c591b37d774ee62af46e48ecc369","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d63334ad6529afa856c7112391a39a2b6c53c591b37d774ee62af46e48ecc369","first_computed_at":"2026-05-18T03:36:06.898781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:06.898781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GMqpmi3cAXGpsYGK0WKfOVTVI700TB95bcLk1liucy42cK2z7v/JgEdj9vY7/GLHpP/w3EE02qffFfKUtOIMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:06.899494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4211","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:688aac8c1459bc7b5a2b4732e03eaef5624a42f9b554577bedeafaab87ca3db9","sha256:65e2bfe0afee2af123037793fd6d4ea407130bd874027f2cd5f0d63a8fd2a613"],"state_sha256":"61a822eadec4d01e0d7d847178634b81990d55170a3a2f36f15983adb5fae404"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QDk93GephgoCecHtGX+Cgb68m4OSXyHNd4CswdMhooD1mEUW62dqbCeqCy0D5FePnnpujM3lpYH1Ak7wwPAfCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:35:08.197986Z","bundle_sha256":"2a4d7a2161300da5c5e7f4bc0cc189a025735b5a6029d9c81cbc4c418f1549d9"}}