{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:AEQHTXNY7REDF3ADXKAH6UZOXL","short_pith_number":"pith:AEQHTXNY","canonical_record":{"source":{"id":"2010.01985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-09-18T21:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"07e7dbf52595168c0c6caaca3ae82e842aac3770232ea6dcf48183c831057a41","abstract_canon_sha256":"893cfc42aedcf1021e73b928ba3ddb37f6de2056d9d6508db84c02e54646ad0f"},"schema_version":"1.0"},"canonical_sha256":"012079ddb8fc4832ec03ba807f532ebac5ae919f89ae7fe93749888a8dbfa0c2","source":{"kind":"arxiv","id":"2010.01985","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.01985","created_at":"2026-07-05T01:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"2010.01985v1","created_at":"2026-07-05T01:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.01985","created_at":"2026-07-05T01:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"AEQHTXNY7RED","created_at":"2026-07-05T01:40:11Z"},{"alias_kind":"pith_short_16","alias_value":"AEQHTXNY7REDF3AD","created_at":"2026-07-05T01:40:11Z"},{"alias_kind":"pith_short_8","alias_value":"AEQHTXNY","created_at":"2026-07-05T01:40:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:AEQHTXNY7REDF3ADXKAH6UZOXL","target":"record","payload":{"canonical_record":{"source":{"id":"2010.01985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-09-18T21:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"07e7dbf52595168c0c6caaca3ae82e842aac3770232ea6dcf48183c831057a41","abstract_canon_sha256":"893cfc42aedcf1021e73b928ba3ddb37f6de2056d9d6508db84c02e54646ad0f"},"schema_version":"1.0"},"canonical_sha256":"012079ddb8fc4832ec03ba807f532ebac5ae919f89ae7fe93749888a8dbfa0c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:11.372612Z","signature_b64":"d/xIOfbtxA78Ss+PpvgRjvFxu1n2fYUDx1axi3QXsbGin51KZAlNzfnoNc4qelv0pnQWhDIpzHJDoRk0NIr/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"012079ddb8fc4832ec03ba807f532ebac5ae919f89ae7fe93749888a8dbfa0c2","last_reissued_at":"2026-07-05T01:40:11.372268Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:11.372268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.01985","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-07-05T01:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wB7CAnIN9yMaK/OFkg5PfWpLUu32KrrDUtWoVjq1xlJHb6x7qrLILr5WP177SLjSngglPM1UFsktePZmHjICDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:49:28.424873Z"},"content_sha256":"d22570941ab8199a4d1735946f114e82b6cda7223d571ef3bde93406439ad1a1","schema_version":"1.0","event_id":"sha256:d22570941ab8199a4d1735946f114e82b6cda7223d571ef3bde93406439ad1a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:AEQHTXNY7REDF3ADXKAH6UZOXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Measuring the Complexity of Domains Used to Evaluate AI Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christopher Pereyda, Lawrence Holder","submitted_at":"2020-09-18T21:53:07Z","abstract_excerpt":"There is currently a rapid increase in the number of challenge problem, benchmarking datasets and algorithmic optimization tests for evaluating AI systems. However, there does not currently exist an objective measure to determine the complexity between these newly created domains. This lack of cross-domain examination creates an obstacle to effectively research more general AI systems. We propose a theory for measuring the complexity between varied domains. This theory is then evaluated using approximations by a population of neural network based AI systems. The approximations are compared to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.01985","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/2010.01985/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-07-05T01:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWeXaJl58YPvHvcvC14nMzPySvAGr+sDcA/NXXVidhqfhG9A3RADWJsVrJem0icx7/4qeObUWu327yM4D+msBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:49:28.425481Z"},"content_sha256":"4576fae69fc678dda57f2d79fcd7ad760d1d571624f5c4e62350ef7b640b07ae","schema_version":"1.0","event_id":"sha256:4576fae69fc678dda57f2d79fcd7ad760d1d571624f5c4e62350ef7b640b07ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEQHTXNY7REDF3ADXKAH6UZOXL/bundle.json","state_url":"https://pith.science/pith/AEQHTXNY7REDF3ADXKAH6UZOXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEQHTXNY7REDF3ADXKAH6UZOXL/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-08-05T19:49:28Z","links":{"resolver":"https://pith.science/pith/AEQHTXNY7REDF3ADXKAH6UZOXL","bundle":"https://pith.science/pith/AEQHTXNY7REDF3ADXKAH6UZOXL/bundle.json","state":"https://pith.science/pith/AEQHTXNY7REDF3ADXKAH6UZOXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEQHTXNY7REDF3ADXKAH6UZOXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:AEQHTXNY7REDF3ADXKAH6UZOXL","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":"893cfc42aedcf1021e73b928ba3ddb37f6de2056d9d6508db84c02e54646ad0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-09-18T21:53:07Z","title_canon_sha256":"07e7dbf52595168c0c6caaca3ae82e842aac3770232ea6dcf48183c831057a41"},"schema_version":"1.0","source":{"id":"2010.01985","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.01985","created_at":"2026-07-05T01:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"2010.01985v1","created_at":"2026-07-05T01:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.01985","created_at":"2026-07-05T01:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"AEQHTXNY7RED","created_at":"2026-07-05T01:40:11Z"},{"alias_kind":"pith_short_16","alias_value":"AEQHTXNY7REDF3AD","created_at":"2026-07-05T01:40:11Z"},{"alias_kind":"pith_short_8","alias_value":"AEQHTXNY","created_at":"2026-07-05T01:40:11Z"}],"graph_snapshots":[{"event_id":"sha256:4576fae69fc678dda57f2d79fcd7ad760d1d571624f5c4e62350ef7b640b07ae","target":"graph","created_at":"2026-07-05T01:40:11Z","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/2010.01985/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"There is currently a rapid increase in the number of challenge problem, benchmarking datasets and algorithmic optimization tests for evaluating AI systems. However, there does not currently exist an objective measure to determine the complexity between these newly created domains. This lack of cross-domain examination creates an obstacle to effectively research more general AI systems. We propose a theory for measuring the complexity between varied domains. This theory is then evaluated using approximations by a population of neural network based AI systems. The approximations are compared to ","authors_text":"Christopher Pereyda, Lawrence Holder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-09-18T21:53:07Z","title":"Measuring the Complexity of Domains Used to Evaluate AI Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.01985","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:d22570941ab8199a4d1735946f114e82b6cda7223d571ef3bde93406439ad1a1","target":"record","created_at":"2026-07-05T01:40:11Z","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":"893cfc42aedcf1021e73b928ba3ddb37f6de2056d9d6508db84c02e54646ad0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-09-18T21:53:07Z","title_canon_sha256":"07e7dbf52595168c0c6caaca3ae82e842aac3770232ea6dcf48183c831057a41"},"schema_version":"1.0","source":{"id":"2010.01985","kind":"arxiv","version":1}},"canonical_sha256":"012079ddb8fc4832ec03ba807f532ebac5ae919f89ae7fe93749888a8dbfa0c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"012079ddb8fc4832ec03ba807f532ebac5ae919f89ae7fe93749888a8dbfa0c2","first_computed_at":"2026-07-05T01:40:11.372268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:40:11.372268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d/xIOfbtxA78Ss+PpvgRjvFxu1n2fYUDx1axi3QXsbGin51KZAlNzfnoNc4qelv0pnQWhDIpzHJDoRk0NIr/Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T01:40:11.372612Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.01985","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d22570941ab8199a4d1735946f114e82b6cda7223d571ef3bde93406439ad1a1","sha256:4576fae69fc678dda57f2d79fcd7ad760d1d571624f5c4e62350ef7b640b07ae"],"state_sha256":"6ab3aa421c9571f643675668e1f61f18cca8fed081934cec8e7709bcc431e52b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlWVl8Qm5IYEARE+ZaKWAzY36bnE2TGJQEbVzwOg8/nqHc15LlIrxaUwszncuOwsea9YZfirV/2ZAHkQNJugCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T19:49:28.431236Z","bundle_sha256":"7cfa06fd241de47e4bb79e607666cad6b269a59a2fba09f8b506edde87f948a5"}}