{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QKGBO2PVCVR5ONWFMBD6IGY5EX","short_pith_number":"pith:QKGBO2PV","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"},"canonical_sha256":"828c1769f51563d736c56047e41b1d25fdd59487ec3841075a545e6551966e2a","source":{"kind":"arxiv","id":"2510.07722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.07722","created_at":"2026-06-09T02:07:10Z"},{"alias_kind":"arxiv_version","alias_value":"2510.07722v1","created_at":"2026-06-09T02:07:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.07722","created_at":"2026-06-09T02:07:10Z"},{"alias_kind":"pith_short_12","alias_value":"QKGBO2PVCVR5","created_at":"2026-06-09T02:07:10Z"},{"alias_kind":"pith_short_16","alias_value":"QKGBO2PVCVR5ONWF","created_at":"2026-06-09T02:07:10Z"},{"alias_kind":"pith_short_8","alias_value":"QKGBO2PV","created_at":"2026-06-09T02:07:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QKGBO2PVCVR5ONWFMBD6IGY5EX","target":"record","payload":{"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"},"canonical_sha256":"828c1769f51563d736c56047e41b1d25fdd59487ec3841075a545e6551966e2a","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"},"source_kind":"arxiv","source_id":"2510.07722","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-06-09T02:07:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3tsPU6TXxttxhT9zuLBpAJJSNzIXbAHPyK+nBto99eyGPnoBf5Sh0mXsNvT0uKeZohDTxeu13cOs0u0qYUIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:47:33.632332Z"},"content_sha256":"91b418193505c7ca720cc114e78be0c40a8f14dbc2372d72bd86b778481d1171","schema_version":"1.0","event_id":"sha256:91b418193505c7ca720cc114e78be0c40a8f14dbc2372d72bd86b778481d1171"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QKGBO2PVCVR5ONWFMBD6IGY5EX","target":"graph","payload":{"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"},"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-06-09T02:07:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qb9XOL4y3AF5XpVe2CPJHQ/tcvbjZQENAHRi+Gf9UyVcGY0ILbrX2sE0wC+FN4fmMB99jrxUsqj7Oq5/f1ZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:47:33.633186Z"},"content_sha256":"9ba703817c5ef6c3c67c7a8766c586393de21c000d97cfa46a1207f84d40cb2f","schema_version":"1.0","event_id":"sha256:9ba703817c5ef6c3c67c7a8766c586393de21c000d97cfa46a1207f84d40cb2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX/bundle.json","state_url":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX/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-10T06:47:33Z","links":{"resolver":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX","bundle":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX/bundle.json","state":"https://pith.science/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKGBO2PVCVR5ONWFMBD6IGY5EX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QKGBO2PVCVR5ONWFMBD6IGY5EX","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":"5b9e56020795cee242c0cf477bf81d98153d84aae49b57a1e3b47ffae0940699","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-09T03:00:58Z","title_canon_sha256":"78b6202022743132fb52351c1fb319a8f332c5ea9cb56f1fb0920a272dcae54a"},"schema_version":"1.0","source":{"id":"2510.07722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.07722","created_at":"2026-06-09T02:07:10Z"},{"alias_kind":"arxiv_version","alias_value":"2510.07722v1","created_at":"2026-06-09T02:07:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.07722","created_at":"2026-06-09T02:07:10Z"},{"alias_kind":"pith_short_12","alias_value":"QKGBO2PVCVR5","created_at":"2026-06-09T02:07:10Z"},{"alias_kind":"pith_short_16","alias_value":"QKGBO2PVCVR5ONWF","created_at":"2026-06-09T02:07:10Z"},{"alias_kind":"pith_short_8","alias_value":"QKGBO2PV","created_at":"2026-06-09T02:07:10Z"}],"graph_snapshots":[{"event_id":"sha256:9ba703817c5ef6c3c67c7a8766c586393de21c000d97cfa46a1207f84d40cb2f","target":"graph","created_at":"2026-06-09T02:07:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.07722/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Russell K. Standish","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-09T03:00:58Z","title":"Is star complexity a proxy for information based complexity of graphs?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.07722","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:91b418193505c7ca720cc114e78be0c40a8f14dbc2372d72bd86b778481d1171","target":"record","created_at":"2026-06-09T02:07:10Z","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":"5b9e56020795cee242c0cf477bf81d98153d84aae49b57a1e3b47ffae0940699","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-09T03:00:58Z","title_canon_sha256":"78b6202022743132fb52351c1fb319a8f332c5ea9cb56f1fb0920a272dcae54a"},"schema_version":"1.0","source":{"id":"2510.07722","kind":"arxiv","version":1}},"canonical_sha256":"828c1769f51563d736c56047e41b1d25fdd59487ec3841075a545e6551966e2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"828c1769f51563d736c56047e41b1d25fdd59487ec3841075a545e6551966e2a","first_computed_at":"2026-06-09T02:07:10.855231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:07:10.855231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zsf1GCJgvqA26cuKeWLhk9ia2IlXqpKaz98ls/O9fsxk90BduucOfFFZzj3EcoVXAXW0rm+3M/fL9IU/7HTYCA==","signature_status":"signed_v1","signed_at":"2026-06-09T02:07:10.856165Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.07722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91b418193505c7ca720cc114e78be0c40a8f14dbc2372d72bd86b778481d1171","sha256:9ba703817c5ef6c3c67c7a8766c586393de21c000d97cfa46a1207f84d40cb2f"],"state_sha256":"9e933bc027ef6fa261af5dd61ad4392a744a2c0e622ac67be3885eb222122241"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ttjO2Wc9qrBkWM7nm34OtZ6jgiuqCExiX7HW+YLnvU/sRexEqPt4Qm9euKFeUeZenla5JSalUNUusCMnqVPaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T06:47:33.637514Z","bundle_sha256":"5fc87f8986b77b5a44d2c54dc8f395867ff3e025e1c0e12807ffa28484342569"}}