{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XE6S75GLDQH56ZRUQ75MNU6D3K","short_pith_number":"pith:XE6S75GL","canonical_record":{"source":{"id":"1706.04721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-15T02:08:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2d2752a3b649a30bb4c2ef54693326068ff37086a500867f9fcce5abc0343307","abstract_canon_sha256":"e2402591ee0ee8c9705b23b8f7354e05d2891ed9482cffa626fdc2dcac287b7d"},"schema_version":"1.0"},"canonical_sha256":"b93d2ff4cb1c0fdf663487fac6d3c3da9115b39dc6e18965beaf0101d279bf23","source":{"kind":"arxiv","id":"1706.04721","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04721","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04721v2","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04721","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"XE6S75GLDQH5","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XE6S75GLDQH56ZRU","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XE6S75GL","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XE6S75GLDQH56ZRUQ75MNU6D3K","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-15T02:08:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2d2752a3b649a30bb4c2ef54693326068ff37086a500867f9fcce5abc0343307","abstract_canon_sha256":"e2402591ee0ee8c9705b23b8f7354e05d2891ed9482cffa626fdc2dcac287b7d"},"schema_version":"1.0"},"canonical_sha256":"b93d2ff4cb1c0fdf663487fac6d3c3da9115b39dc6e18965beaf0101d279bf23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:35.849596Z","signature_b64":"YIfo7BbvF++CX4x9mP09f1ik+YDpmQh+7uWr2x8mqq1GuCw86KKihbB5t5P8Wzeuey1cOJNJM42iJDlOhBm/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b93d2ff4cb1c0fdf663487fac6d3c3da9115b39dc6e18965beaf0101d279bf23","last_reissued_at":"2026-05-18T00:31:35.849087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:35.849087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04721","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-18T00:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9e/V963gyqtj1xLgabxmNVZTc4H8R0N7VuujiQAPqVxfef0mOpIrl5N0yICdGnxewwAEGFqE565yhhm+FdpeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:36:55.701751Z"},"content_sha256":"87d39732b2d8f3aab06342029237e1a8093eb3ab370836642962d22866d18b10","schema_version":"1.0","event_id":"sha256:87d39732b2d8f3aab06342029237e1a8093eb3ab370836642962d22866d18b10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XE6S75GLDQH56ZRUQ75MNU6D3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Target Curricula via Selection of Minimum Feature Sets: a Case Study in Boolean Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Pablo Moscato, Shannon Fenn","submitted_at":"2017-06-15T02:08:54Z","abstract_excerpt":"We consider the effect of introducing a curriculum of targets when training Boolean models on supervised Multi Label Classification (MLC) problems. In particular, we consider how to order targets in the absence of prior knowledge, and how such a curriculum may be enforced when using meta-heuristics to train discrete non-linear models.\n  We show that hierarchical dependencies between targets can be exploited by enforcing an appropriate curriculum using hierarchical loss functions. On several multi output circuit-inference problems with known target difficulties, Feedforward Boolean Networks (FB"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04721","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-18T00:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0A16uC6YFHfVfpjVqQL7iztKkn7MNCMKLrg9TR2u7iiW5WNH3rFUH6W7kBemXfVJRlm+YO2TqXc6oFgDqKMWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:36:55.702093Z"},"content_sha256":"c06c8d6bcea1dbdc9b6756999347270f4ad68abe61801cba89306a92167b1072","schema_version":"1.0","event_id":"sha256:c06c8d6bcea1dbdc9b6756999347270f4ad68abe61801cba89306a92167b1072"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XE6S75GLDQH56ZRUQ75MNU6D3K/bundle.json","state_url":"https://pith.science/pith/XE6S75GLDQH56ZRUQ75MNU6D3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XE6S75GLDQH56ZRUQ75MNU6D3K/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-04T15:36:55Z","links":{"resolver":"https://pith.science/pith/XE6S75GLDQH56ZRUQ75MNU6D3K","bundle":"https://pith.science/pith/XE6S75GLDQH56ZRUQ75MNU6D3K/bundle.json","state":"https://pith.science/pith/XE6S75GLDQH56ZRUQ75MNU6D3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XE6S75GLDQH56ZRUQ75MNU6D3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XE6S75GLDQH56ZRUQ75MNU6D3K","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":"e2402591ee0ee8c9705b23b8f7354e05d2891ed9482cffa626fdc2dcac287b7d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-15T02:08:54Z","title_canon_sha256":"2d2752a3b649a30bb4c2ef54693326068ff37086a500867f9fcce5abc0343307"},"schema_version":"1.0","source":{"id":"1706.04721","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04721","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04721v2","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04721","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"XE6S75GLDQH5","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XE6S75GLDQH56ZRU","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XE6S75GL","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:c06c8d6bcea1dbdc9b6756999347270f4ad68abe61801cba89306a92167b1072","target":"graph","created_at":"2026-05-18T00:31:35Z","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 consider the effect of introducing a curriculum of targets when training Boolean models on supervised Multi Label Classification (MLC) problems. In particular, we consider how to order targets in the absence of prior knowledge, and how such a curriculum may be enforced when using meta-heuristics to train discrete non-linear models.\n  We show that hierarchical dependencies between targets can be exploited by enforcing an appropriate curriculum using hierarchical loss functions. On several multi output circuit-inference problems with known target difficulties, Feedforward Boolean Networks (FB","authors_text":"Pablo Moscato, Shannon Fenn","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-15T02:08:54Z","title":"Target Curricula via Selection of Minimum Feature Sets: a Case Study in Boolean Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04721","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:87d39732b2d8f3aab06342029237e1a8093eb3ab370836642962d22866d18b10","target":"record","created_at":"2026-05-18T00:31:35Z","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":"e2402591ee0ee8c9705b23b8f7354e05d2891ed9482cffa626fdc2dcac287b7d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-15T02:08:54Z","title_canon_sha256":"2d2752a3b649a30bb4c2ef54693326068ff37086a500867f9fcce5abc0343307"},"schema_version":"1.0","source":{"id":"1706.04721","kind":"arxiv","version":2}},"canonical_sha256":"b93d2ff4cb1c0fdf663487fac6d3c3da9115b39dc6e18965beaf0101d279bf23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b93d2ff4cb1c0fdf663487fac6d3c3da9115b39dc6e18965beaf0101d279bf23","first_computed_at":"2026-05-18T00:31:35.849087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:35.849087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YIfo7BbvF++CX4x9mP09f1ik+YDpmQh+7uWr2x8mqq1GuCw86KKihbB5t5P8Wzeuey1cOJNJM42iJDlOhBm/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:35.849596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04721","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87d39732b2d8f3aab06342029237e1a8093eb3ab370836642962d22866d18b10","sha256:c06c8d6bcea1dbdc9b6756999347270f4ad68abe61801cba89306a92167b1072"],"state_sha256":"0f7c38cc10da793e36fb1524e92e2a7aa2c67ccbf95aab11d59d207d1f490785"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wsfSaWEgiJawTEocvag94fZqC0hZLcpYRgxUoMlJ0JjOt4nFfhJ3B+gWdXOHvpiXZQaXUjhDNcbp2RNxtp4eCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:36:55.704019Z","bundle_sha256":"532144204f3d87278cb64b6404ff4cd4198b703fe7cb63ea1625afa34e5f7898"}}