{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:M2LGCCKH7I4O37SCD2L54Y34SG","short_pith_number":"pith:M2LGCCKH","schema_version":"1.0","canonical_sha256":"6696610947fa38edfe421e97de637c91864c170a78af330060db2fa77dd24f39","source":{"kind":"arxiv","id":"1203.6159","version":1},"attestation_state":"computed","paper":{"title":"On Graph Refutation for Relational Inclusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Brazil), Paulo A. S. Veloso (COPPE-UFRJ, Sheila R. M. Veloso (FEN-UERJ","submitted_at":"2012-03-28T05:06:25Z","abstract_excerpt":"We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a relational inclusion to establishing that a graph constructed from it has empty extension. This sound and complete calculus is conceptually simpler and easier to use than the usual ones."},"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":"1203.6159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-28T05:06:25Z","cross_cats_sorted":[],"title_canon_sha256":"c4640ddd23fc7d8f3a6fd6904fc915fd94825542b945cdb226a94361a83d7e2e","abstract_canon_sha256":"5ad673946b0c6fc82e8216bbccec4239fcb5b7e6ce8074165b7eb8a8ed27449c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:04.000749Z","signature_b64":"NHcYeQ9qjCiDIRxCvMeSUp55Aeb0MF4/E6dRjdsY+mxWPb0AmscbsBLaB74TGS5S5GSGUsHDhxt9pS0ve7PbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6696610947fa38edfe421e97de637c91864c170a78af330060db2fa77dd24f39","last_reissued_at":"2026-05-18T03:59:04.000291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:04.000291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Graph Refutation for Relational Inclusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Brazil), Paulo A. S. Veloso (COPPE-UFRJ, Sheila R. M. Veloso (FEN-UERJ","submitted_at":"2012-03-28T05:06:25Z","abstract_excerpt":"We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a relational inclusion to establishing that a graph constructed from it has empty extension. This sound and complete calculus is conceptually simpler and easier to use than the usual ones."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6159","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":"1203.6159","created_at":"2026-05-18T03:59:04.000371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.6159v1","created_at":"2026-05-18T03:59:04.000371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6159","created_at":"2026-05-18T03:59:04.000371+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2LGCCKH7I4O","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2LGCCKH7I4O37SC","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2LGCCKH","created_at":"2026-05-18T12:27:14.488303+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/M2LGCCKH7I4O37SCD2L54Y34SG","json":"https://pith.science/pith/M2LGCCKH7I4O37SCD2L54Y34SG.json","graph_json":"https://pith.science/api/pith-number/M2LGCCKH7I4O37SCD2L54Y34SG/graph.json","events_json":"https://pith.science/api/pith-number/M2LGCCKH7I4O37SCD2L54Y34SG/events.json","paper":"https://pith.science/paper/M2LGCCKH"},"agent_actions":{"view_html":"https://pith.science/pith/M2LGCCKH7I4O37SCD2L54Y34SG","download_json":"https://pith.science/pith/M2LGCCKH7I4O37SCD2L54Y34SG.json","view_paper":"https://pith.science/paper/M2LGCCKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.6159&json=true","fetch_graph":"https://pith.science/api/pith-number/M2LGCCKH7I4O37SCD2L54Y34SG/graph.json","fetch_events":"https://pith.science/api/pith-number/M2LGCCKH7I4O37SCD2L54Y34SG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2LGCCKH7I4O37SCD2L54Y34SG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2LGCCKH7I4O37SCD2L54Y34SG/action/storage_attestation","attest_author":"https://pith.science/pith/M2LGCCKH7I4O37SCD2L54Y34SG/action/author_attestation","sign_citation":"https://pith.science/pith/M2LGCCKH7I4O37SCD2L54Y34SG/action/citation_signature","submit_replication":"https://pith.science/pith/M2LGCCKH7I4O37SCD2L54Y34SG/action/replication_record"}},"created_at":"2026-05-18T03:59:04.000371+00:00","updated_at":"2026-05-18T03:59:04.000371+00:00"}