{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2YZTJLLFFGX2QVWHCERZDI42FN","short_pith_number":"pith:2YZTJLLF","schema_version":"1.0","canonical_sha256":"d63334ad6529afa856c7112391a39a2b6c53c591b37d774ee62af46e48ecc369","source":{"kind":"arxiv","id":"1301.4211","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.4211","created_at":"2026-05-18T03:36:06.898928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4211v1","created_at":"2026-05-18T03:36:06.898928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4211","created_at":"2026-05-18T03:36:06.898928+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YZTJLLFFGX2","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YZTJLLFFGX2QVWH","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YZTJLLF","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN","json":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN.json","graph_json":"https://pith.science/api/pith-number/2YZTJLLFFGX2QVWHCERZDI42FN/graph.json","events_json":"https://pith.science/api/pith-number/2YZTJLLFFGX2QVWHCERZDI42FN/events.json","paper":"https://pith.science/paper/2YZTJLLF"},"agent_actions":{"view_html":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN","download_json":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN.json","view_paper":"https://pith.science/paper/2YZTJLLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4211&json=true","fetch_graph":"https://pith.science/api/pith-number/2YZTJLLFFGX2QVWHCERZDI42FN/graph.json","fetch_events":"https://pith.science/api/pith-number/2YZTJLLFFGX2QVWHCERZDI42FN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN/action/storage_attestation","attest_author":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN/action/author_attestation","sign_citation":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN/action/citation_signature","submit_replication":"https://pith.science/pith/2YZTJLLFFGX2QVWHCERZDI42FN/action/replication_record"}},"created_at":"2026-05-18T03:36:06.898928+00:00","updated_at":"2026-05-18T03:36:06.898928+00:00"}