{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IZBWOSCEXECP55Q5LIRJPTUYL4","short_pith_number":"pith:IZBWOSCE","schema_version":"1.0","canonical_sha256":"4643674844b904fef61d5a2297ce985f335dac65c58018b3aa2ee9af0266e4dc","source":{"kind":"arxiv","id":"1507.00655","version":1},"attestation_state":"computed","paper":{"title":"Reasoning about embedded dependencies using inclusion dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Miika Hannula","submitted_at":"2015-07-02T16:45:43Z","abstract_excerpt":"The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded dependencies that is based on the chase and uses inclusion dependencies and implicit existential quantification in the intermediate steps of deductions."},"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":"1507.00655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-02T16:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"1ce7ce1022a687d184ca3fa3a8d20ca2e13b5a124aec918f5d0f89df4cf19c86","abstract_canon_sha256":"d09a03f5cc2397cf873b74375aa3bc7e45c3fda05c786577a2e53b921cae8748"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:24.001649Z","signature_b64":"d/OF7AdfM5dmddk0EXv34W5ywzpLxzXcXBH0sNClK/mEAOqM1C55j2G1X3ukQltdZjWh+aTC4fkAlZ3H6wTeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4643674844b904fef61d5a2297ce985f335dac65c58018b3aa2ee9af0266e4dc","last_reissued_at":"2026-05-18T01:37:24.001125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:24.001125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reasoning about embedded dependencies using inclusion dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Miika Hannula","submitted_at":"2015-07-02T16:45:43Z","abstract_excerpt":"The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded dependencies that is based on the chase and uses inclusion dependencies and implicit existential quantification in the intermediate steps of deductions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00655","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":"1507.00655","created_at":"2026-05-18T01:37:24.001208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00655v1","created_at":"2026-05-18T01:37:24.001208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00655","created_at":"2026-05-18T01:37:24.001208+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZBWOSCEXECP","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZBWOSCEXECP55Q5","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZBWOSCE","created_at":"2026-05-18T12:29:27.538025+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/IZBWOSCEXECP55Q5LIRJPTUYL4","json":"https://pith.science/pith/IZBWOSCEXECP55Q5LIRJPTUYL4.json","graph_json":"https://pith.science/api/pith-number/IZBWOSCEXECP55Q5LIRJPTUYL4/graph.json","events_json":"https://pith.science/api/pith-number/IZBWOSCEXECP55Q5LIRJPTUYL4/events.json","paper":"https://pith.science/paper/IZBWOSCE"},"agent_actions":{"view_html":"https://pith.science/pith/IZBWOSCEXECP55Q5LIRJPTUYL4","download_json":"https://pith.science/pith/IZBWOSCEXECP55Q5LIRJPTUYL4.json","view_paper":"https://pith.science/paper/IZBWOSCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00655&json=true","fetch_graph":"https://pith.science/api/pith-number/IZBWOSCEXECP55Q5LIRJPTUYL4/graph.json","fetch_events":"https://pith.science/api/pith-number/IZBWOSCEXECP55Q5LIRJPTUYL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZBWOSCEXECP55Q5LIRJPTUYL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZBWOSCEXECP55Q5LIRJPTUYL4/action/storage_attestation","attest_author":"https://pith.science/pith/IZBWOSCEXECP55Q5LIRJPTUYL4/action/author_attestation","sign_citation":"https://pith.science/pith/IZBWOSCEXECP55Q5LIRJPTUYL4/action/citation_signature","submit_replication":"https://pith.science/pith/IZBWOSCEXECP55Q5LIRJPTUYL4/action/replication_record"}},"created_at":"2026-05-18T01:37:24.001208+00:00","updated_at":"2026-05-18T01:37:24.001208+00:00"}