{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KCQMKNM5HEIJ3UPGUBLQM2MURW","short_pith_number":"pith:KCQMKNM5","schema_version":"1.0","canonical_sha256":"50a0c5359d39109dd1e6a0570669948dac90b507267f465fc6be159db5ff826d","source":{"kind":"arxiv","id":"1808.07050","version":1},"attestation_state":"computed","paper":{"title":"Vicious Circle Principle and Logic Programs with Aggregates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Michael Gelfond, Yuanlin Zhang","submitted_at":"2018-08-21T04:16:03Z","abstract_excerpt":"The paper presents a knowledge representation language $\\mathcal{A}log$ which extends ASP with aggregates. The goal is to have a language based on simple syntax and clear intuitive and mathematical semantics. We give some properties of $\\mathcal{A}log$, an algorithm for computing its answer sets, and comparison with other approaches."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1808.07050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-21T04:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"7431019a0ee964867492f1b1db93616df244b9a554de96080d12f8801ba569f9","abstract_canon_sha256":"c4fb56017334e9819173e4792bca86231b010e5c3b2b0b47020334e8446b01f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:32.044796Z","signature_b64":"LGZprTicAVzV6En4VoL6zA+R3nVdAImNFLZyUrgv61Z/r2wQqHQtBsvZBdrH9e1fQhUHmP64bUibxEbgsRhDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50a0c5359d39109dd1e6a0570669948dac90b507267f465fc6be159db5ff826d","last_reissued_at":"2026-05-18T00:07:32.044292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:32.044292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vicious Circle Principle and Logic Programs with Aggregates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Michael Gelfond, Yuanlin Zhang","submitted_at":"2018-08-21T04:16:03Z","abstract_excerpt":"The paper presents a knowledge representation language $\\mathcal{A}log$ which extends ASP with aggregates. The goal is to have a language based on simple syntax and clear intuitive and mathematical semantics. We give some properties of $\\mathcal{A}log$, an algorithm for computing its answer sets, and comparison with other approaches."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07050","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.07050","created_at":"2026-05-18T00:07:32.044378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07050v1","created_at":"2026-05-18T00:07:32.044378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07050","created_at":"2026-05-18T00:07:32.044378+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCQMKNM5HEIJ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCQMKNM5HEIJ3UPG","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCQMKNM5","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KCQMKNM5HEIJ3UPGUBLQM2MURW","json":"https://pith.science/pith/KCQMKNM5HEIJ3UPGUBLQM2MURW.json","graph_json":"https://pith.science/api/pith-number/KCQMKNM5HEIJ3UPGUBLQM2MURW/graph.json","events_json":"https://pith.science/api/pith-number/KCQMKNM5HEIJ3UPGUBLQM2MURW/events.json","paper":"https://pith.science/paper/KCQMKNM5"},"agent_actions":{"view_html":"https://pith.science/pith/KCQMKNM5HEIJ3UPGUBLQM2MURW","download_json":"https://pith.science/pith/KCQMKNM5HEIJ3UPGUBLQM2MURW.json","view_paper":"https://pith.science/paper/KCQMKNM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07050&json=true","fetch_graph":"https://pith.science/api/pith-number/KCQMKNM5HEIJ3UPGUBLQM2MURW/graph.json","fetch_events":"https://pith.science/api/pith-number/KCQMKNM5HEIJ3UPGUBLQM2MURW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCQMKNM5HEIJ3UPGUBLQM2MURW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCQMKNM5HEIJ3UPGUBLQM2MURW/action/storage_attestation","attest_author":"https://pith.science/pith/KCQMKNM5HEIJ3UPGUBLQM2MURW/action/author_attestation","sign_citation":"https://pith.science/pith/KCQMKNM5HEIJ3UPGUBLQM2MURW/action/citation_signature","submit_replication":"https://pith.science/pith/KCQMKNM5HEIJ3UPGUBLQM2MURW/action/replication_record"}},"created_at":"2026-05-18T00:07:32.044378+00:00","updated_at":"2026-05-18T00:07:32.044378+00:00"}