{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WNMNIBOJXGBQ6QIU474TCCLZ7X","short_pith_number":"pith:WNMNIBOJ","canonical_record":{"source":{"id":"1801.05159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-16T08:54:20Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4114f8c18d6e9ca315a2bc5af7029c7b3146f33fe0837058be1e6631b967fed8","abstract_canon_sha256":"f0a71d6d627b40f2586d507fd367855661b8d011d641bdb48f083fdfb7fda70b"},"schema_version":"1.0"},"canonical_sha256":"b358d405c9b9830f4114e7f9310979fdd065debb79d71c335146a86a0176e9c6","source":{"kind":"arxiv","id":"1801.05159","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05159","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05159v1","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05159","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"WNMNIBOJXGBQ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WNMNIBOJXGBQ6QIU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WNMNIBOJ","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WNMNIBOJXGBQ6QIU474TCCLZ7X","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-16T08:54:20Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4114f8c18d6e9ca315a2bc5af7029c7b3146f33fe0837058be1e6631b967fed8","abstract_canon_sha256":"f0a71d6d627b40f2586d507fd367855661b8d011d641bdb48f083fdfb7fda70b"},"schema_version":"1.0"},"canonical_sha256":"b358d405c9b9830f4114e7f9310979fdd065debb79d71c335146a86a0176e9c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:47.693681Z","signature_b64":"kzTKmRvjJ1QBwRlmXmMnIvUDj3K56VADLcE7VxnTBvzvU/nzXyiK0HDWvnEJSrIDzoeBKqmwSkrZOFPr9ivwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b358d405c9b9830f4114e7f9310979fdd065debb79d71c335146a86a0176e9c6","last_reissued_at":"2026-05-18T00:25:47.692972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:47.692972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05159","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-05-18T00:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jOrRdoY4UxzVA5V5xSJcH0WIZKCYAKz10P4T2qOLiSQM4AChKNLgC7Mlw3VzsgX40Eqi8SioChwNZlkRLFskDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:52:02.667868Z"},"content_sha256":"8076cf10726509173d151c7b3d366c4f22d4c89d67eedc3afe4fa620f9aefd5d","schema_version":"1.0","event_id":"sha256:8076cf10726509173d151c7b3d366c4f22d4c89d67eedc3afe4fa620f9aefd5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WNMNIBOJXGBQ6QIU474TCCLZ7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GitGraph - Architecture Search Space Creation through Frequent Computational Subgraph Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Andreea Hossmann, Claudiu Musat, Kamil Bennani-Smires, Michael Baeriswyl","submitted_at":"2018-01-16T08:54:20Z","abstract_excerpt":"The dramatic success of deep neural networks across multiple application areas often relies on experts painstakingly designing a network architecture specific to each task. To simplify this process and make it more accessible, an emerging research effort seeks to automate the design of neural network architectures, using e.g. evolutionary algorithms or reinforcement learning or simple search in a constrained space of neural modules.\n  Considering the typical size of the search space (e.g. $10^{10}$ candidates for a $10$-layer network) and the cost of evaluating a single candidate, current arch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05159","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"},"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-18T00:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kI7iAFKTsshZDWglri47ypmtzwUOb5mMSjjQhxse92JtYDFOxnsLDc0iEZQs2xsqK2plpFKzMrLkThHxkrwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:52:02.668503Z"},"content_sha256":"1eaaed5b616d1fb87726cb942909f7800357b417224637af35eb17a343646c73","schema_version":"1.0","event_id":"sha256:1eaaed5b616d1fb87726cb942909f7800357b417224637af35eb17a343646c73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNMNIBOJXGBQ6QIU474TCCLZ7X/bundle.json","state_url":"https://pith.science/pith/WNMNIBOJXGBQ6QIU474TCCLZ7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNMNIBOJXGBQ6QIU474TCCLZ7X/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-05T06:52:02Z","links":{"resolver":"https://pith.science/pith/WNMNIBOJXGBQ6QIU474TCCLZ7X","bundle":"https://pith.science/pith/WNMNIBOJXGBQ6QIU474TCCLZ7X/bundle.json","state":"https://pith.science/pith/WNMNIBOJXGBQ6QIU474TCCLZ7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNMNIBOJXGBQ6QIU474TCCLZ7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WNMNIBOJXGBQ6QIU474TCCLZ7X","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":"f0a71d6d627b40f2586d507fd367855661b8d011d641bdb48f083fdfb7fda70b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-16T08:54:20Z","title_canon_sha256":"4114f8c18d6e9ca315a2bc5af7029c7b3146f33fe0837058be1e6631b967fed8"},"schema_version":"1.0","source":{"id":"1801.05159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05159","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05159v1","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05159","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"WNMNIBOJXGBQ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WNMNIBOJXGBQ6QIU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WNMNIBOJ","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:1eaaed5b616d1fb87726cb942909f7800357b417224637af35eb17a343646c73","target":"graph","created_at":"2026-05-18T00:25:47Z","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":"The dramatic success of deep neural networks across multiple application areas often relies on experts painstakingly designing a network architecture specific to each task. To simplify this process and make it more accessible, an emerging research effort seeks to automate the design of neural network architectures, using e.g. evolutionary algorithms or reinforcement learning or simple search in a constrained space of neural modules.\n  Considering the typical size of the search space (e.g. $10^{10}$ candidates for a $10$-layer network) and the cost of evaluating a single candidate, current arch","authors_text":"Andreea Hossmann, Claudiu Musat, Kamil Bennani-Smires, Michael Baeriswyl","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-16T08:54:20Z","title":"GitGraph - Architecture Search Space Creation through Frequent Computational Subgraph Mining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05159","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:8076cf10726509173d151c7b3d366c4f22d4c89d67eedc3afe4fa620f9aefd5d","target":"record","created_at":"2026-05-18T00:25:47Z","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":"f0a71d6d627b40f2586d507fd367855661b8d011d641bdb48f083fdfb7fda70b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-16T08:54:20Z","title_canon_sha256":"4114f8c18d6e9ca315a2bc5af7029c7b3146f33fe0837058be1e6631b967fed8"},"schema_version":"1.0","source":{"id":"1801.05159","kind":"arxiv","version":1}},"canonical_sha256":"b358d405c9b9830f4114e7f9310979fdd065debb79d71c335146a86a0176e9c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b358d405c9b9830f4114e7f9310979fdd065debb79d71c335146a86a0176e9c6","first_computed_at":"2026-05-18T00:25:47.692972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:47.692972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kzTKmRvjJ1QBwRlmXmMnIvUDj3K56VADLcE7VxnTBvzvU/nzXyiK0HDWvnEJSrIDzoeBKqmwSkrZOFPr9ivwBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:47.693681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8076cf10726509173d151c7b3d366c4f22d4c89d67eedc3afe4fa620f9aefd5d","sha256:1eaaed5b616d1fb87726cb942909f7800357b417224637af35eb17a343646c73"],"state_sha256":"550df1dee17d99b0aa20f1bb49d79693e3e913211935fee50ec7b0f4229ccd22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PnolcK9hpGr1zuqusikJO2uk4XJ3NACi/jNpbM11gp7nNLz908DzXSfpYxONhSYrxKO0xCCvuOe5CKh3uD6BAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:52:02.672373Z","bundle_sha256":"3c8905e92f30df758f2e4d3e38003e497fef57c0d8f8d2af3ef2803efdb30056"}}