{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QKGBO2PVCVR5ONWFMBD6IGY5EX","short_pith_number":"pith:QKGBO2PV","schema_version":"1.0","canonical_sha256":"828c1769f51563d736c56047e41b1d25fdd59487ec3841075a545e6551966e2a","source":{"kind":"arxiv","id":"2510.07722","version":1},"attestation_state":"computed","paper":{"title":"Is star complexity a proxy for information based complexity of graphs?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Russell K. Standish","submitted_at":"2025-10-09T03:00:58Z","abstract_excerpt":"Information-based complexity (IBC) is a well-defined complexity measure of any object given a description in a language and a classifier that identifies those descriptions with the object. Of course, the exact numerical value will vary according to the descriptive language and classifier, but under certain universality conditions (eg the classifier identifies programs of a universal Turning machine that halt and output the same value), asymptotically, the complexity measure is independent of the classifier up to a constant of O(1). The hypothesis being investigated in this work that any practi"},"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":"2510.07722","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-09T03:00:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"78b6202022743132fb52351c1fb319a8f332c5ea9cb56f1fb0920a272dcae54a","abstract_canon_sha256":"5b9e56020795cee242c0cf477bf81d98153d84aae49b57a1e3b47ffae0940699"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:10.856165Z","signature_b64":"zsf1GCJgvqA26cuKeWLhk9ia2IlXqpKaz98ls/O9fsxk90BduucOfFFZzj3EcoVXAXW0rm+3M/fL9IU/7HTYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"828c1769f51563d736c56047e41b1d25fdd59487ec3841075a545e6551966e2a","last_reissued_at":"2026-06-09T02:07:10.855231Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:10.855231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Is star complexity a proxy for information based complexity of graphs?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Russell K. Standish","submitted_at":"2025-10-09T03:00:58Z","abstract_excerpt":"Information-based complexity (IBC) is a well-defined complexity measure of any object given a description in a language and a classifier that identifies those descriptions with the object. Of course, the exact numerical value will vary according to the descriptive language and classifier, but under certain universality conditions (eg the classifier identifies programs of a universal Turning machine that halt and output the same value), asymptotically, the complexity measure is independent of the classifier up to a constant of O(1). The hypothesis being investigated in this work that any practi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.07722","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/2510.07722/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2510.07722","created_at":"2026-06-09T02:07:10.855352+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.07722v1","created_at":"2026-06-09T02:07:10.855352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.07722","created_at":"2026-06-09T02:07:10.855352+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKGBO2PVCVR5","created_at":"2026-06-09T02:07:10.855352+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKGBO2PVCVR5ONWF","created_at":"2026-06-09T02:07:10.855352+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKGBO2PV","created_at":"2026-06-09T02:07:10.855352+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.16327","citing_title":"An improved upper bound measure of star complexity of graphs","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX","json":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX.json","graph_json":"https://pith.science/api/pith-number/QKGBO2PVCVR5ONWFMBD6IGY5EX/graph.json","events_json":"https://pith.science/api/pith-number/QKGBO2PVCVR5ONWFMBD6IGY5EX/events.json","paper":"https://pith.science/paper/QKGBO2PV"},"agent_actions":{"view_html":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX","download_json":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX.json","view_paper":"https://pith.science/paper/QKGBO2PV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.07722&json=true","fetch_graph":"https://pith.science/api/pith-number/QKGBO2PVCVR5ONWFMBD6IGY5EX/graph.json","fetch_events":"https://pith.science/api/pith-number/QKGBO2PVCVR5ONWFMBD6IGY5EX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX/action/storage_attestation","attest_author":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX/action/author_attestation","sign_citation":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX/action/citation_signature","submit_replication":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX/action/replication_record"}},"created_at":"2026-06-09T02:07:10.855352+00:00","updated_at":"2026-06-09T02:07:10.855352+00:00"}