{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZASZ6JD2VD2XYTF6N7MGV5T44X","short_pith_number":"pith:ZASZ6JD2","schema_version":"1.0","canonical_sha256":"c8259f247aa8f57c4cbe6fd86af67ce5d14519d35bca68e6b9d3148d80051e1e","source":{"kind":"arxiv","id":"1308.4125","version":1},"attestation_state":"computed","paper":{"title":"Understanding Rulelog Computations in Silk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"Benjamin N. Grosof, Brett Benyo, Carl Andersen, Michael Kifer, Miguel Calejo, Mike Dean, Paul Fodor, Senlin Liang, Terrance Swift","submitted_at":"2013-08-19T07:15:34Z","abstract_excerpt":"Rulelog is a knowledge representation and reasoning language based on logic programming under the well-founded semantics. It is an extension of the language of Flora-2 and so supports inheritance and other object-oriented features, as well as the higher-order syntax of Hilog. However, Rulelog rules may also contain quantifiers and may be contra-positional. In addition, these rules are evaluated in the presence of defeasibility mechanisms that include rule cancellation, rule priorities, and other aspects. Rulelog programs are sometimes developed by loosely coordinated teams of knowledge enginee"},"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":"1308.4125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-08-19T07:15:34Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"fdcf602015ecb5cbb1b3b2afeced39e6b8e62968ffb38f24ba443b5f5cd1d3cf","abstract_canon_sha256":"558ad36b2668a12b698e4d3cc1a58f1859ac64f4f14b62c73106c229b1af2b66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:33.655270Z","signature_b64":"F5U4Tv4v6oaCW8B/RV6gGFcWi9/w8OK70lH+OBr0i8qcR3oaG+KO8Vlqhk0qTLVh1HS9SYYJTV6PEBAbfrkuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8259f247aa8f57c4cbe6fd86af67ce5d14519d35bca68e6b9d3148d80051e1e","last_reissued_at":"2026-05-18T03:15:33.654185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:33.654185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding Rulelog Computations in Silk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"Benjamin N. Grosof, Brett Benyo, Carl Andersen, Michael Kifer, Miguel Calejo, Mike Dean, Paul Fodor, Senlin Liang, Terrance Swift","submitted_at":"2013-08-19T07:15:34Z","abstract_excerpt":"Rulelog is a knowledge representation and reasoning language based on logic programming under the well-founded semantics. It is an extension of the language of Flora-2 and so supports inheritance and other object-oriented features, as well as the higher-order syntax of Hilog. However, Rulelog rules may also contain quantifiers and may be contra-positional. In addition, these rules are evaluated in the presence of defeasibility mechanisms that include rule cancellation, rule priorities, and other aspects. Rulelog programs are sometimes developed by loosely coordinated teams of knowledge enginee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4125","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":"1308.4125","created_at":"2026-05-18T03:15:33.654309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4125v1","created_at":"2026-05-18T03:15:33.654309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4125","created_at":"2026-05-18T03:15:33.654309+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZASZ6JD2VD2X","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZASZ6JD2VD2XYTF6","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZASZ6JD2","created_at":"2026-05-18T12:28:09.283467+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/ZASZ6JD2VD2XYTF6N7MGV5T44X","json":"https://pith.science/pith/ZASZ6JD2VD2XYTF6N7MGV5T44X.json","graph_json":"https://pith.science/api/pith-number/ZASZ6JD2VD2XYTF6N7MGV5T44X/graph.json","events_json":"https://pith.science/api/pith-number/ZASZ6JD2VD2XYTF6N7MGV5T44X/events.json","paper":"https://pith.science/paper/ZASZ6JD2"},"agent_actions":{"view_html":"https://pith.science/pith/ZASZ6JD2VD2XYTF6N7MGV5T44X","download_json":"https://pith.science/pith/ZASZ6JD2VD2XYTF6N7MGV5T44X.json","view_paper":"https://pith.science/paper/ZASZ6JD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4125&json=true","fetch_graph":"https://pith.science/api/pith-number/ZASZ6JD2VD2XYTF6N7MGV5T44X/graph.json","fetch_events":"https://pith.science/api/pith-number/ZASZ6JD2VD2XYTF6N7MGV5T44X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZASZ6JD2VD2XYTF6N7MGV5T44X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZASZ6JD2VD2XYTF6N7MGV5T44X/action/storage_attestation","attest_author":"https://pith.science/pith/ZASZ6JD2VD2XYTF6N7MGV5T44X/action/author_attestation","sign_citation":"https://pith.science/pith/ZASZ6JD2VD2XYTF6N7MGV5T44X/action/citation_signature","submit_replication":"https://pith.science/pith/ZASZ6JD2VD2XYTF6N7MGV5T44X/action/replication_record"}},"created_at":"2026-05-18T03:15:33.654309+00:00","updated_at":"2026-05-18T03:15:33.654309+00:00"}