{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BEVO4LLLKESCJ2T6U7RBLDJBDO","short_pith_number":"pith:BEVO4LLL","canonical_record":{"source":{"id":"1802.06462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-18T22:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"17c4b21961b1980fd5760980cb95297559f59520bf7e30aaa7916a071af813ff","abstract_canon_sha256":"85f2efc25b531de69c05c2ad0df88ec2c0d29592ff27dc5b4694904dd7ebdb02"},"schema_version":"1.0"},"canonical_sha256":"092aee2d6b512424ea7ea7e2158d211baaeba7e1165054ff724fc03bc3443939","source":{"kind":"arxiv","id":"1802.06462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06462","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06462v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06462","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"BEVO4LLLKESC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BEVO4LLLKESCJ2T6","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BEVO4LLL","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BEVO4LLLKESCJ2T6U7RBLDJBDO","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-18T22:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"17c4b21961b1980fd5760980cb95297559f59520bf7e30aaa7916a071af813ff","abstract_canon_sha256":"85f2efc25b531de69c05c2ad0df88ec2c0d29592ff27dc5b4694904dd7ebdb02"},"schema_version":"1.0"},"canonical_sha256":"092aee2d6b512424ea7ea7e2158d211baaeba7e1165054ff724fc03bc3443939","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.203994Z","signature_b64":"nWr9Oi/wrX+fzuJ5wIWTvZI1fOeoPVV9NQLggzdOw91+bFaFiOVEsycFQ2n9lDYFLQNJhGZSne53MO27GkayAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"092aee2d6b512424ea7ea7e2158d211baaeba7e1165054ff724fc03bc3443939","last_reissued_at":"2026-05-18T00:23:03.203443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.203443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06462","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:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GaCuD7+JeUC7vt3EnXTnbK52O3LtNf7wpi88kX5FcOP2kn/CBn+vpU0b0VSw+n5nCA1w+r7MtHl5UWgPvOXtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:40:15.897748Z"},"content_sha256":"8a72e3cb472ac2dd2a8e521afee7d14cad6b59b5e693435b41414eefec836d59","schema_version":"1.0","event_id":"sha256:8a72e3cb472ac2dd2a8e521afee7d14cad6b59b5e693435b41414eefec836d59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BEVO4LLLKESCJ2T6U7RBLDJBDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heuristic Based Induction of Answer Set Programs: From Default theories to combinatorial problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Farhad Shakerin, Gopal Gupta","submitted_at":"2018-02-18T22:48:49Z","abstract_excerpt":"Significant research has been conducted in recent years to extend Inductive Logic Programming (ILP) methods to induce Answer Set Programs (ASP). These methods perform an exhaustive search for the correct hypothesis by encoding an ILP problem instance as an ASP program. Exhaustive search, however, results in loss of scalability. In addition, the language bias employed in these methods is overly restrictive too. In this paper we extend our previous work on learning stratified answer set programs that have a single stable model to learning arbitrary (i.e., non-stratified) ones with multiple stabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06462","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:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nDziRha4DITnmaFvztQmoMo/iomo2bugDTeCtR0KqnyWJBxAg4AMtnUvUSk9U/9LHx5tS9spOGfRbhKXOvL6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:40:15.898157Z"},"content_sha256":"83065b8cd6b6f031b108ac01ab05ee0db86b9d5742488f633409e7caf86cfd34","schema_version":"1.0","event_id":"sha256:83065b8cd6b6f031b108ac01ab05ee0db86b9d5742488f633409e7caf86cfd34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEVO4LLLKESCJ2T6U7RBLDJBDO/bundle.json","state_url":"https://pith.science/pith/BEVO4LLLKESCJ2T6U7RBLDJBDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEVO4LLLKESCJ2T6U7RBLDJBDO/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-05-27T22:40:15Z","links":{"resolver":"https://pith.science/pith/BEVO4LLLKESCJ2T6U7RBLDJBDO","bundle":"https://pith.science/pith/BEVO4LLLKESCJ2T6U7RBLDJBDO/bundle.json","state":"https://pith.science/pith/BEVO4LLLKESCJ2T6U7RBLDJBDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEVO4LLLKESCJ2T6U7RBLDJBDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BEVO4LLLKESCJ2T6U7RBLDJBDO","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":"85f2efc25b531de69c05c2ad0df88ec2c0d29592ff27dc5b4694904dd7ebdb02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-18T22:48:49Z","title_canon_sha256":"17c4b21961b1980fd5760980cb95297559f59520bf7e30aaa7916a071af813ff"},"schema_version":"1.0","source":{"id":"1802.06462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06462","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06462v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06462","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"BEVO4LLLKESC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BEVO4LLLKESCJ2T6","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BEVO4LLL","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:83065b8cd6b6f031b108ac01ab05ee0db86b9d5742488f633409e7caf86cfd34","target":"graph","created_at":"2026-05-18T00:23:03Z","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":"Significant research has been conducted in recent years to extend Inductive Logic Programming (ILP) methods to induce Answer Set Programs (ASP). These methods perform an exhaustive search for the correct hypothesis by encoding an ILP problem instance as an ASP program. Exhaustive search, however, results in loss of scalability. In addition, the language bias employed in these methods is overly restrictive too. In this paper we extend our previous work on learning stratified answer set programs that have a single stable model to learning arbitrary (i.e., non-stratified) ones with multiple stabl","authors_text":"Farhad Shakerin, Gopal Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-18T22:48:49Z","title":"Heuristic Based Induction of Answer Set Programs: From Default theories to combinatorial problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06462","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:8a72e3cb472ac2dd2a8e521afee7d14cad6b59b5e693435b41414eefec836d59","target":"record","created_at":"2026-05-18T00:23:03Z","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":"85f2efc25b531de69c05c2ad0df88ec2c0d29592ff27dc5b4694904dd7ebdb02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-18T22:48:49Z","title_canon_sha256":"17c4b21961b1980fd5760980cb95297559f59520bf7e30aaa7916a071af813ff"},"schema_version":"1.0","source":{"id":"1802.06462","kind":"arxiv","version":1}},"canonical_sha256":"092aee2d6b512424ea7ea7e2158d211baaeba7e1165054ff724fc03bc3443939","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"092aee2d6b512424ea7ea7e2158d211baaeba7e1165054ff724fc03bc3443939","first_computed_at":"2026-05-18T00:23:03.203443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:03.203443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nWr9Oi/wrX+fzuJ5wIWTvZI1fOeoPVV9NQLggzdOw91+bFaFiOVEsycFQ2n9lDYFLQNJhGZSne53MO27GkayAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:03.203994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a72e3cb472ac2dd2a8e521afee7d14cad6b59b5e693435b41414eefec836d59","sha256:83065b8cd6b6f031b108ac01ab05ee0db86b9d5742488f633409e7caf86cfd34"],"state_sha256":"ac0894cc08bc29bc72d0f61c3ceb5777c04f80db31564fb193eb806d0151dff1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SHn8UWRv3GrbUB3anP4MGMe1CSnoO5HH85pGlEamKz9SfZLN4K+EwMqDXl7YDCl7d3T4DyHyeFf06DSqTFXoBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:40:15.900644Z","bundle_sha256":"a6efff5e109a2eccd411d390134173c32059f021003fe5bcb4992f72cd7934bd"}}