{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C7AWOFIRAXYSSDKOKTDEGD5GB4","short_pith_number":"pith:C7AWOFIR","canonical_record":{"source":{"id":"1708.05563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-18T11:19:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"13ba466d02765244ec2405f1ca301a90fc3b7a9d9258976c994f703c061325df","abstract_canon_sha256":"2e6f151406fe8386156468049aaeb097624afc0f46eb6cb064602447a03392ea"},"schema_version":"1.0"},"canonical_sha256":"17c167151105f1290d4e54c6430fa60f3a372729629dd20df2e2cb086622c622","source":{"kind":"arxiv","id":"1708.05563","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05563","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05563v1","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05563","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"pith_short_12","alias_value":"C7AWOFIRAXYS","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C7AWOFIRAXYSSDKO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C7AWOFIR","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C7AWOFIRAXYSSDKOKTDEGD5GB4","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-18T11:19:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"13ba466d02765244ec2405f1ca301a90fc3b7a9d9258976c994f703c061325df","abstract_canon_sha256":"2e6f151406fe8386156468049aaeb097624afc0f46eb6cb064602447a03392ea"},"schema_version":"1.0"},"canonical_sha256":"17c167151105f1290d4e54c6430fa60f3a372729629dd20df2e2cb086622c622","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:49.695491Z","signature_b64":"4XpJOKXd7NAWjVXPI3+FQjYy+z1OnXbVQuNIYSovjmEh/dTWAIKgIAvUdFpoKU4IDOhnzvlO1Ah3TxL2sLMuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17c167151105f1290d4e54c6430fa60f3a372729629dd20df2e2cb086622c622","last_reissued_at":"2026-05-18T00:37:49.695028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:49.695028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05563","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:37:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDIHWuHIKl3by4D8UKG/0Gvm7h42IMlWmqxfr+P0ktRe0wz0hLQyA4/EJjFFjbqf5inB2LKwzfSTqFDF24Z3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:00:53.190291Z"},"content_sha256":"126899a87e55fd69a06b92c0e2d5da41a473d7c2ecb5de3be570668fb8c7130f","schema_version":"1.0","event_id":"sha256:126899a87e55fd69a06b92c0e2d5da41a473d7c2ecb5de3be570668fb8c7130f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C7AWOFIRAXYSSDKOKTDEGD5GB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Induction of Decision Trees based on Generalized Graph Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fernando Sancho-Caparrini, Pedro Almagro-Blanco","submitted_at":"2017-08-18T11:19:01Z","abstract_excerpt":"Usually, decision tree induction algorithms are limited to work with non relational data. Given a record, they do not take into account other objects attributes even though they can provide valuable information for the learning task. In this paper we present GGQ-ID3, a multi-relational decision tree learning algorithm that uses Generalized Graph Queries (GGQ) as predicates in the decision nodes. GGQs allow to express complex patterns (including cycles) and they can be refined step-by-step. Also, they can evaluate structures (not only single records) and perform Regular Pattern Matching. GGQ ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05563","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:37:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACYu1FL3NYbyL/wattArQlDedtCMVv+tvJbtImqeLFi55O/WBy5XmPuOj8NFr2I1mRWyBKcSbROIhiL7L998Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:00:53.190751Z"},"content_sha256":"b86e29dd7f6e34784d3b6430067f003c66ebdef8ed97056331b44a4d31f35937","schema_version":"1.0","event_id":"sha256:b86e29dd7f6e34784d3b6430067f003c66ebdef8ed97056331b44a4d31f35937"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7AWOFIRAXYSSDKOKTDEGD5GB4/bundle.json","state_url":"https://pith.science/pith/C7AWOFIRAXYSSDKOKTDEGD5GB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7AWOFIRAXYSSDKOKTDEGD5GB4/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-29T11:00:53Z","links":{"resolver":"https://pith.science/pith/C7AWOFIRAXYSSDKOKTDEGD5GB4","bundle":"https://pith.science/pith/C7AWOFIRAXYSSDKOKTDEGD5GB4/bundle.json","state":"https://pith.science/pith/C7AWOFIRAXYSSDKOKTDEGD5GB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7AWOFIRAXYSSDKOKTDEGD5GB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C7AWOFIRAXYSSDKOKTDEGD5GB4","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":"2e6f151406fe8386156468049aaeb097624afc0f46eb6cb064602447a03392ea","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-18T11:19:01Z","title_canon_sha256":"13ba466d02765244ec2405f1ca301a90fc3b7a9d9258976c994f703c061325df"},"schema_version":"1.0","source":{"id":"1708.05563","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05563","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05563v1","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05563","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"pith_short_12","alias_value":"C7AWOFIRAXYS","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C7AWOFIRAXYSSDKO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C7AWOFIR","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:b86e29dd7f6e34784d3b6430067f003c66ebdef8ed97056331b44a4d31f35937","target":"graph","created_at":"2026-05-18T00:37:49Z","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":"Usually, decision tree induction algorithms are limited to work with non relational data. Given a record, they do not take into account other objects attributes even though they can provide valuable information for the learning task. In this paper we present GGQ-ID3, a multi-relational decision tree learning algorithm that uses Generalized Graph Queries (GGQ) as predicates in the decision nodes. GGQs allow to express complex patterns (including cycles) and they can be refined step-by-step. Also, they can evaluate structures (not only single records) and perform Regular Pattern Matching. GGQ ar","authors_text":"Fernando Sancho-Caparrini, Pedro Almagro-Blanco","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-18T11:19:01Z","title":"Induction of Decision Trees based on Generalized Graph Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05563","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:126899a87e55fd69a06b92c0e2d5da41a473d7c2ecb5de3be570668fb8c7130f","target":"record","created_at":"2026-05-18T00:37:49Z","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":"2e6f151406fe8386156468049aaeb097624afc0f46eb6cb064602447a03392ea","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-18T11:19:01Z","title_canon_sha256":"13ba466d02765244ec2405f1ca301a90fc3b7a9d9258976c994f703c061325df"},"schema_version":"1.0","source":{"id":"1708.05563","kind":"arxiv","version":1}},"canonical_sha256":"17c167151105f1290d4e54c6430fa60f3a372729629dd20df2e2cb086622c622","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17c167151105f1290d4e54c6430fa60f3a372729629dd20df2e2cb086622c622","first_computed_at":"2026-05-18T00:37:49.695028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:49.695028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4XpJOKXd7NAWjVXPI3+FQjYy+z1OnXbVQuNIYSovjmEh/dTWAIKgIAvUdFpoKU4IDOhnzvlO1Ah3TxL2sLMuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:49.695491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05563","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:126899a87e55fd69a06b92c0e2d5da41a473d7c2ecb5de3be570668fb8c7130f","sha256:b86e29dd7f6e34784d3b6430067f003c66ebdef8ed97056331b44a4d31f35937"],"state_sha256":"8c34ab13e12b416317e33ab1246707efa58a7221627426c61214c73c5e84229a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cqwXeI6lsa9OFshxPG4EZPHZGYgOLyMdYffNVBDl0GD9QjFCsHxcnvsbADt030pbDyQPbIflVqdayPAFbbFKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T11:00:53.192803Z","bundle_sha256":"83bb71a98b427eca29728d7f0b45ac9d51588787b1e4fbdd48289c3a87203f61"}}