{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:R63MZO4ZQST5VREVMEP7EVLWS7","short_pith_number":"pith:R63MZO4Z","canonical_record":{"source":{"id":"2109.12624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-09-26T14:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"02122a53ee3ac01837dced2a3cf1b5bda19870b185649b83c0872edae78db234","abstract_canon_sha256":"289dfeaa5946779190eea3162fdb48c23adf0668b565382bfb86648aa17464ed"},"schema_version":"1.0"},"canonical_sha256":"8fb6ccbb9984a7dac495611ff2557697fd5006d2f371aee912d4f1564f7ce4e0","source":{"kind":"arxiv","id":"2109.12624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.12624","created_at":"2026-07-05T03:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"2109.12624v1","created_at":"2026-07-05T03:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.12624","created_at":"2026-07-05T03:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"R63MZO4ZQST5","created_at":"2026-07-05T03:17:34Z"},{"alias_kind":"pith_short_16","alias_value":"R63MZO4ZQST5VREV","created_at":"2026-07-05T03:17:34Z"},{"alias_kind":"pith_short_8","alias_value":"R63MZO4Z","created_at":"2026-07-05T03:17:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:R63MZO4ZQST5VREVMEP7EVLWS7","target":"record","payload":{"canonical_record":{"source":{"id":"2109.12624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-09-26T14:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"02122a53ee3ac01837dced2a3cf1b5bda19870b185649b83c0872edae78db234","abstract_canon_sha256":"289dfeaa5946779190eea3162fdb48c23adf0668b565382bfb86648aa17464ed"},"schema_version":"1.0"},"canonical_sha256":"8fb6ccbb9984a7dac495611ff2557697fd5006d2f371aee912d4f1564f7ce4e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:17:34.582528Z","signature_b64":"RbO1tB2Nh0hH7ZDPpZ/pMdW1k+IDwsoaYW/RU+NxIOcDeGZ4jfXcKVW8HbFWv1B+SaZoRN7GAliNSwsTu2cNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fb6ccbb9984a7dac495611ff2557697fd5006d2f371aee912d4f1564f7ce4e0","last_reissued_at":"2026-07-05T03:17:34.582047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:17:34.582047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.12624","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-05T03:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+l9Vbshn3vQxsRwrlbvPvrwlIf06n57ueTQOvr1aAs+LIuwaCUW2B0fX+f/qqOOSukvI8poJNByfoO17PSoBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T13:13:45.761846Z"},"content_sha256":"d15379e35745555f38a1ccf8d705f6d642721175d27599318afb16b11e8e20b2","schema_version":"1.0","event_id":"sha256:d15379e35745555f38a1ccf8d705f6d642721175d27599318afb16b11e8e20b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:R63MZO4ZQST5VREVMEP7EVLWS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Clustering and Demotion Based Algorithm for Inductive Learning of Default Theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Farhad Shakerin, Gopal Gupta, Huaduo Wang","submitted_at":"2021-09-26T14:50:18Z","abstract_excerpt":"We present a clustering- and demotion-based algorithm called Kmeans-FOLD to induce nonmonotonic logic programs from positive and negative examples. Our algorithm improves upon-and is inspired by-the FOLD algorithm. The FOLD algorithm itself is an improvement over the FOIL algorithm. Our algorithm generates a more concise logic program compared to the FOLD algorithm. Our algorithm uses the K-means based clustering method to cluster the input positive samples before applying the FOLD algorithm. Positive examples that are covered by the partially learned program in intermediate steps are not disc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.12624","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/2109.12624/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-05T03:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRg+EDTgNVY/zWfFizlFI+jNe60imj3kzkQED7zhJGDNkPlo7X9Uie5RLQU0J2d7vBUKeyiZ3fmU1q+Abv0dCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T13:13:45.762220Z"},"content_sha256":"67ddc778fb288941cf3637bc339552c6ad1c88d716d62a55974e4549f9026bb4","schema_version":"1.0","event_id":"sha256:67ddc778fb288941cf3637bc339552c6ad1c88d716d62a55974e4549f9026bb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R63MZO4ZQST5VREVMEP7EVLWS7/bundle.json","state_url":"https://pith.science/pith/R63MZO4ZQST5VREVMEP7EVLWS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R63MZO4ZQST5VREVMEP7EVLWS7/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-21T13:13:45Z","links":{"resolver":"https://pith.science/pith/R63MZO4ZQST5VREVMEP7EVLWS7","bundle":"https://pith.science/pith/R63MZO4ZQST5VREVMEP7EVLWS7/bundle.json","state":"https://pith.science/pith/R63MZO4ZQST5VREVMEP7EVLWS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R63MZO4ZQST5VREVMEP7EVLWS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:R63MZO4ZQST5VREVMEP7EVLWS7","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":"289dfeaa5946779190eea3162fdb48c23adf0668b565382bfb86648aa17464ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-09-26T14:50:18Z","title_canon_sha256":"02122a53ee3ac01837dced2a3cf1b5bda19870b185649b83c0872edae78db234"},"schema_version":"1.0","source":{"id":"2109.12624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.12624","created_at":"2026-07-05T03:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"2109.12624v1","created_at":"2026-07-05T03:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.12624","created_at":"2026-07-05T03:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"R63MZO4ZQST5","created_at":"2026-07-05T03:17:34Z"},{"alias_kind":"pith_short_16","alias_value":"R63MZO4ZQST5VREV","created_at":"2026-07-05T03:17:34Z"},{"alias_kind":"pith_short_8","alias_value":"R63MZO4Z","created_at":"2026-07-05T03:17:34Z"}],"graph_snapshots":[{"event_id":"sha256:67ddc778fb288941cf3637bc339552c6ad1c88d716d62a55974e4549f9026bb4","target":"graph","created_at":"2026-07-05T03:17:34Z","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/2109.12624/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a clustering- and demotion-based algorithm called Kmeans-FOLD to induce nonmonotonic logic programs from positive and negative examples. Our algorithm improves upon-and is inspired by-the FOLD algorithm. The FOLD algorithm itself is an improvement over the FOIL algorithm. Our algorithm generates a more concise logic program compared to the FOLD algorithm. Our algorithm uses the K-means based clustering method to cluster the input positive samples before applying the FOLD algorithm. Positive examples that are covered by the partially learned program in intermediate steps are not disc","authors_text":"Farhad Shakerin, Gopal Gupta, Huaduo Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-09-26T14:50:18Z","title":"A Clustering and Demotion Based Algorithm for Inductive Learning of Default Theories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.12624","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:d15379e35745555f38a1ccf8d705f6d642721175d27599318afb16b11e8e20b2","target":"record","created_at":"2026-07-05T03:17:34Z","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":"289dfeaa5946779190eea3162fdb48c23adf0668b565382bfb86648aa17464ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-09-26T14:50:18Z","title_canon_sha256":"02122a53ee3ac01837dced2a3cf1b5bda19870b185649b83c0872edae78db234"},"schema_version":"1.0","source":{"id":"2109.12624","kind":"arxiv","version":1}},"canonical_sha256":"8fb6ccbb9984a7dac495611ff2557697fd5006d2f371aee912d4f1564f7ce4e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fb6ccbb9984a7dac495611ff2557697fd5006d2f371aee912d4f1564f7ce4e0","first_computed_at":"2026-07-05T03:17:34.582047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:17:34.582047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RbO1tB2Nh0hH7ZDPpZ/pMdW1k+IDwsoaYW/RU+NxIOcDeGZ4jfXcKVW8HbFWv1B+SaZoRN7GAliNSwsTu2cNBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:17:34.582528Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.12624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d15379e35745555f38a1ccf8d705f6d642721175d27599318afb16b11e8e20b2","sha256:67ddc778fb288941cf3637bc339552c6ad1c88d716d62a55974e4549f9026bb4"],"state_sha256":"198a90f669a8a26cb551f0b4c65bcd63a17dc0e457e883999512bd74005dd792"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRS0H+4LI3VbSzd7iXQm+mFOGo3898BqzCn8MzAamKvr4srDwmBFx5v3J2lMX+KGDmxhRgL62HdzBDW4yYYoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T13:13:45.765076Z","bundle_sha256":"3bfce2158870bb935ad5c14a64cd0e13a2f1fd2dbade280709ef8703f9d20350"}}