{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:55G333BWHZTZFZ3OY2IMD6AQUY","short_pith_number":"pith:55G333BW","canonical_record":{"source":{"id":"2104.01190","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-04-02T18:16:20Z","cross_cats_sorted":[],"title_canon_sha256":"49bc6ede49adc9458af0f0033bce380535e51437c29ffe9f891e76b248bd4e78","abstract_canon_sha256":"31a1131b52b2cfa71545e8660c1b48ed58fb0d7cd7041ac51fc1c5f1bd9a61ee"},"schema_version":"1.0"},"canonical_sha256":"ef4dbdec363e6792e76ec690c1f810a6065928a8ebd5f5df2d550596b4fb42f8","source":{"kind":"arxiv","id":"2104.01190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.01190","created_at":"2026-07-05T02:28:57Z"},{"alias_kind":"arxiv_version","alias_value":"2104.01190v1","created_at":"2026-07-05T02:28:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.01190","created_at":"2026-07-05T02:28:57Z"},{"alias_kind":"pith_short_12","alias_value":"55G333BWHZTZ","created_at":"2026-07-05T02:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"55G333BWHZTZFZ3O","created_at":"2026-07-05T02:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"55G333BW","created_at":"2026-07-05T02:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:55G333BWHZTZFZ3OY2IMD6AQUY","target":"record","payload":{"canonical_record":{"source":{"id":"2104.01190","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-04-02T18:16:20Z","cross_cats_sorted":[],"title_canon_sha256":"49bc6ede49adc9458af0f0033bce380535e51437c29ffe9f891e76b248bd4e78","abstract_canon_sha256":"31a1131b52b2cfa71545e8660c1b48ed58fb0d7cd7041ac51fc1c5f1bd9a61ee"},"schema_version":"1.0"},"canonical_sha256":"ef4dbdec363e6792e76ec690c1f810a6065928a8ebd5f5df2d550596b4fb42f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:57.521951Z","signature_b64":"RLP5rmh3ZH7BPJiHzs/Z7AdNf2d1lnc4Q+yI0w/Gzq0h0dnYRcNMByG08tOw6kMBopN1QDxpJ9A9juUaUQJFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef4dbdec363e6792e76ec690c1f810a6065928a8ebd5f5df2d550596b4fb42f8","last_reissued_at":"2026-07-05T02:28:57.521482Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:57.521482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.01190","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-05T02:28:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JNrw3DTJyexuz+DV2bupK0Q67FJnjZTnb1unn1YfTNFvDUwxArrvcMaQHPsnwcmotEQnZoOhiBsJ9yiBImuyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:15:45.107620Z"},"content_sha256":"5bceebe699cf2b3e48f9ae448bfb3387726cc5ea8a982c258651c20e90274f11","schema_version":"1.0","event_id":"sha256:5bceebe699cf2b3e48f9ae448bfb3387726cc5ea8a982c258651c20e90274f11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:55G333BWHZTZFZ3OY2IMD6AQUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"grASP: A Graph Based ASP-Solver and Justification System","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fang Li, Gopal Gupta, Huaduo Wang","submitted_at":"2021-04-02T18:16:20Z","abstract_excerpt":"Answer set programming (ASP) is a popular nonmonotonic-logic based paradigm for knowledge representation and solving combinatorial problems. Computing the answer set of an ASP program is NP-hard in general, and researchers have been investing significant effort to speed it up. The majority of current ASP solvers employ SAT solver-like technology to find these answer sets. As a result, justification for why a literal is in the answer set is hard to produce. There are dependency graph based approaches to find answer sets, but due to the representational limitations of dependency graphs, such app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.01190","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/2104.01190/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-05T02:28:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7vsXUSa9grn5DSEgoNwN5poxH1DqfCBbDMPQnxuhvVo42Qb2ExqNxjaW8HQHuFwkAXdlrh3k6c3B73Di4ffCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:15:45.108243Z"},"content_sha256":"fd9c5560def6536a16de994bebcd047d1e55c46c948f82afa299f14343e1b640","schema_version":"1.0","event_id":"sha256:fd9c5560def6536a16de994bebcd047d1e55c46c948f82afa299f14343e1b640"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55G333BWHZTZFZ3OY2IMD6AQUY/bundle.json","state_url":"https://pith.science/pith/55G333BWHZTZFZ3OY2IMD6AQUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55G333BWHZTZFZ3OY2IMD6AQUY/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-21T22:15:45Z","links":{"resolver":"https://pith.science/pith/55G333BWHZTZFZ3OY2IMD6AQUY","bundle":"https://pith.science/pith/55G333BWHZTZFZ3OY2IMD6AQUY/bundle.json","state":"https://pith.science/pith/55G333BWHZTZFZ3OY2IMD6AQUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55G333BWHZTZFZ3OY2IMD6AQUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:55G333BWHZTZFZ3OY2IMD6AQUY","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":"31a1131b52b2cfa71545e8660c1b48ed58fb0d7cd7041ac51fc1c5f1bd9a61ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-04-02T18:16:20Z","title_canon_sha256":"49bc6ede49adc9458af0f0033bce380535e51437c29ffe9f891e76b248bd4e78"},"schema_version":"1.0","source":{"id":"2104.01190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.01190","created_at":"2026-07-05T02:28:57Z"},{"alias_kind":"arxiv_version","alias_value":"2104.01190v1","created_at":"2026-07-05T02:28:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.01190","created_at":"2026-07-05T02:28:57Z"},{"alias_kind":"pith_short_12","alias_value":"55G333BWHZTZ","created_at":"2026-07-05T02:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"55G333BWHZTZFZ3O","created_at":"2026-07-05T02:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"55G333BW","created_at":"2026-07-05T02:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:fd9c5560def6536a16de994bebcd047d1e55c46c948f82afa299f14343e1b640","target":"graph","created_at":"2026-07-05T02:28:57Z","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/2104.01190/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Answer set programming (ASP) is a popular nonmonotonic-logic based paradigm for knowledge representation and solving combinatorial problems. Computing the answer set of an ASP program is NP-hard in general, and researchers have been investing significant effort to speed it up. The majority of current ASP solvers employ SAT solver-like technology to find these answer sets. As a result, justification for why a literal is in the answer set is hard to produce. There are dependency graph based approaches to find answer sets, but due to the representational limitations of dependency graphs, such app","authors_text":"Fang Li, Gopal Gupta, Huaduo Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-04-02T18:16:20Z","title":"grASP: A Graph Based ASP-Solver and Justification System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.01190","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:5bceebe699cf2b3e48f9ae448bfb3387726cc5ea8a982c258651c20e90274f11","target":"record","created_at":"2026-07-05T02:28:57Z","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":"31a1131b52b2cfa71545e8660c1b48ed58fb0d7cd7041ac51fc1c5f1bd9a61ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-04-02T18:16:20Z","title_canon_sha256":"49bc6ede49adc9458af0f0033bce380535e51437c29ffe9f891e76b248bd4e78"},"schema_version":"1.0","source":{"id":"2104.01190","kind":"arxiv","version":1}},"canonical_sha256":"ef4dbdec363e6792e76ec690c1f810a6065928a8ebd5f5df2d550596b4fb42f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef4dbdec363e6792e76ec690c1f810a6065928a8ebd5f5df2d550596b4fb42f8","first_computed_at":"2026-07-05T02:28:57.521482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:28:57.521482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RLP5rmh3ZH7BPJiHzs/Z7AdNf2d1lnc4Q+yI0w/Gzq0h0dnYRcNMByG08tOw6kMBopN1QDxpJ9A9juUaUQJFCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:28:57.521951Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.01190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bceebe699cf2b3e48f9ae448bfb3387726cc5ea8a982c258651c20e90274f11","sha256:fd9c5560def6536a16de994bebcd047d1e55c46c948f82afa299f14343e1b640"],"state_sha256":"fe24a1f03ed1273a1a592ecca0611e6db8ebed62f64ff19990dc969509a3f5ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0Q9N9u4/VbVzdIx7XxhVbor4YoamEQj0HBBbK2u6cK0yzF/Avph9dCt4mdNKVE6eQDonBkcMAnvipUfFrBuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T22:15:45.116369Z","bundle_sha256":"47fe87e4ca9f8d5025a8b072e6bb4e75060a2ac0a66cdbfecc8309a97f7fabb8"}}