{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:L3NUZSUF6RIVYUKEEB5NHCYBIE","short_pith_number":"pith:L3NUZSUF","canonical_record":{"source":{"id":"1603.04904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-03-15T22:20:52Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"c44533b00b2188ff33b924702e3338cf80305b80ca6bccef79d70338970500f8","abstract_canon_sha256":"3be5db6e7d7143d24a18c77ac32d29f02b6edfd72056f9d33f6ee010a99fde7b"},"schema_version":"1.0"},"canonical_sha256":"5edb4cca85f4515c5144207ad38b01412b075ca1e6d8350635d0c142cf9ff223","source":{"kind":"arxiv","id":"1603.04904","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04904","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04904v2","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04904","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"L3NUZSUF6RIV","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L3NUZSUF6RIVYUKE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L3NUZSUF","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:L3NUZSUF6RIVYUKEEB5NHCYBIE","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-03-15T22:20:52Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"c44533b00b2188ff33b924702e3338cf80305b80ca6bccef79d70338970500f8","abstract_canon_sha256":"3be5db6e7d7143d24a18c77ac32d29f02b6edfd72056f9d33f6ee010a99fde7b"},"schema_version":"1.0"},"canonical_sha256":"5edb4cca85f4515c5144207ad38b01412b075ca1e6d8350635d0c142cf9ff223","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:36.564189Z","signature_b64":"LpqSnEDsz2QMsvyY4KvlQF8tRDa5J1gDyQ86ZCLOFyZKWinLXTqNAsQN7Uq4Jw2AFK1eiK5vkdg67fM+xpOPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5edb4cca85f4515c5144207ad38b01412b075ca1e6d8350635d0c142cf9ff223","last_reissued_at":"2026-05-18T01:03:36.563480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:36.563480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04904","source_version":2,"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-18T01:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8CxFzAAjrGuuZ1Aj5j1m4Nbdt/pXUwDmfH+uLPSqw722MAP6VcoCNHvdNHuQejaUfdN9XUx0lKPA+54sruFGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:01:09.792263Z"},"content_sha256":"e64fc81dc2df752d14f53e62c074ec25339957ae63843d0efca27e130f8ddc85","schema_version":"1.0","event_id":"sha256:e64fc81dc2df752d14f53e62c074ec25339957ae63843d0efca27e130f8ddc85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:L3NUZSUF6RIVYUKEEB5NHCYBIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Turing learning: a metric-free approach to inferring behavior and its application to swarms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"Melvin Gauci, Roderich Gross, Wei Li","submitted_at":"2016-03-15T22:20:52Z","abstract_excerpt":"We propose Turing Learning, a novel system identification method for inferring the behavior of natural or artificial systems. Turing Learning simultaneously optimizes two populations of computer programs, one representing models of the behavior of the system under investigation, and the other representing classifiers. By observing the behavior of the system as well as the behaviors produced by the models, two sets of data samples are obtained. The classifiers are rewarded for discriminating between these two sets, that is, for correctly categorizing data samples as either genuine or counterfei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04904","kind":"arxiv","version":2},"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-18T01:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+xYnDJ1W0xKpB1vvknTT32dtQuoe1PMEqK5eHJKX+B4guYkJRKLkePVwUpO0JBvFtEc8HJzwV2DQd7TXcpvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:01:09.793030Z"},"content_sha256":"fa5bb05d993f4a11661a71ee636173fef8eb78307c641d1c3f98e678309a9672","schema_version":"1.0","event_id":"sha256:fa5bb05d993f4a11661a71ee636173fef8eb78307c641d1c3f98e678309a9672"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3NUZSUF6RIVYUKEEB5NHCYBIE/bundle.json","state_url":"https://pith.science/pith/L3NUZSUF6RIVYUKEEB5NHCYBIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3NUZSUF6RIVYUKEEB5NHCYBIE/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-06T06:01:09Z","links":{"resolver":"https://pith.science/pith/L3NUZSUF6RIVYUKEEB5NHCYBIE","bundle":"https://pith.science/pith/L3NUZSUF6RIVYUKEEB5NHCYBIE/bundle.json","state":"https://pith.science/pith/L3NUZSUF6RIVYUKEEB5NHCYBIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3NUZSUF6RIVYUKEEB5NHCYBIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:L3NUZSUF6RIVYUKEEB5NHCYBIE","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":"3be5db6e7d7143d24a18c77ac32d29f02b6edfd72056f9d33f6ee010a99fde7b","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-03-15T22:20:52Z","title_canon_sha256":"c44533b00b2188ff33b924702e3338cf80305b80ca6bccef79d70338970500f8"},"schema_version":"1.0","source":{"id":"1603.04904","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04904","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04904v2","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04904","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"L3NUZSUF6RIV","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L3NUZSUF6RIVYUKE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L3NUZSUF","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:fa5bb05d993f4a11661a71ee636173fef8eb78307c641d1c3f98e678309a9672","target":"graph","created_at":"2026-05-18T01:03:36Z","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":"We propose Turing Learning, a novel system identification method for inferring the behavior of natural or artificial systems. Turing Learning simultaneously optimizes two populations of computer programs, one representing models of the behavior of the system under investigation, and the other representing classifiers. By observing the behavior of the system as well as the behaviors produced by the models, two sets of data samples are obtained. The classifiers are rewarded for discriminating between these two sets, that is, for correctly categorizing data samples as either genuine or counterfei","authors_text":"Melvin Gauci, Roderich Gross, Wei Li","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-03-15T22:20:52Z","title":"Turing learning: a metric-free approach to inferring behavior and its application to swarms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04904","kind":"arxiv","version":2},"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:e64fc81dc2df752d14f53e62c074ec25339957ae63843d0efca27e130f8ddc85","target":"record","created_at":"2026-05-18T01:03:36Z","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":"3be5db6e7d7143d24a18c77ac32d29f02b6edfd72056f9d33f6ee010a99fde7b","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-03-15T22:20:52Z","title_canon_sha256":"c44533b00b2188ff33b924702e3338cf80305b80ca6bccef79d70338970500f8"},"schema_version":"1.0","source":{"id":"1603.04904","kind":"arxiv","version":2}},"canonical_sha256":"5edb4cca85f4515c5144207ad38b01412b075ca1e6d8350635d0c142cf9ff223","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5edb4cca85f4515c5144207ad38b01412b075ca1e6d8350635d0c142cf9ff223","first_computed_at":"2026-05-18T01:03:36.563480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:36.563480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LpqSnEDsz2QMsvyY4KvlQF8tRDa5J1gDyQ86ZCLOFyZKWinLXTqNAsQN7Uq4Jw2AFK1eiK5vkdg67fM+xpOPBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:36.564189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04904","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e64fc81dc2df752d14f53e62c074ec25339957ae63843d0efca27e130f8ddc85","sha256:fa5bb05d993f4a11661a71ee636173fef8eb78307c641d1c3f98e678309a9672"],"state_sha256":"b636f74ac1c8a8789288cbb1f373a5ff5ea31ee679d3f392370a8dbd6cda4098"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8E3WdkpqmMoz3RD71bXuIGp5rqq2oqDF4Kd82yWA1wTeZmcF4r8oi3AnWwE6U5fKW6OR3tERFl3mSia4XHRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:01:09.797379Z","bundle_sha256":"b716a10e446ca48b7c8125bb0191437cea5ac97c8b11255ef3b263f9fb7f9f2b"}}