{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZYACE6IT2DM77I47TZ537FYEK5","short_pith_number":"pith:ZYACE6IT","schema_version":"1.0","canonical_sha256":"ce00227913d0d9ffa39f9e7bbf97045756891ae7b7418633823c0a9ad209e56b","source":{"kind":"arxiv","id":"2608.02321","version":1},"attestation_state":"computed","paper":{"title":"FastGFDs: Efficient Validation of Graph Functional Dependencies with Desbordante","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PF"],"primary_cat":"cs.DB","authors_text":"Anton Chernikov, George Chernishev, Kirill Smirnov, Yurii Litvinov","submitted_at":"2026-08-03T14:46:21Z","abstract_excerpt":"Graph functional dependencies (GFD) are a recently-developed concept aimed at capturing both topological structures in graphs and functional dependencies between attributes. The process of verifying whether a given GFD holds over a particular graph is referred to as GFD validation. In this very computationally expensive problem, locating suitable subgraphs accounts for about 99% of the total run time. The concept's authors originally proposed a parallel scheme (algorithm), targeting specifically clusters of high-performance servers.\n  The goal of this study is to open GFD validation to a broad"},"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":"2608.02321","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2026-08-03T14:46:21Z","cross_cats_sorted":["cs.AI","cs.LG","cs.PF"],"title_canon_sha256":"3903c0d53388ab7f25b9c500256b08ab35d16dca20b79bc90094c22923486a28","abstract_canon_sha256":"56cbebd4d11b76473cba88908437e65fc2cef0d2292e50762c72c8298cae82e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:11:48.609087Z","signature_b64":"6AXMlBXGj3OIUjsVeqhpiLePaplB6Gsy96Qd+zsS2WrXlnS8bpm3WSBsABrQyoqCjcPgHNcTQu+BJx/esrQrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce00227913d0d9ffa39f9e7bbf97045756891ae7b7418633823c0a9ad209e56b","last_reissued_at":"2026-08-04T02:11:48.607567Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:11:48.607567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FastGFDs: Efficient Validation of Graph Functional Dependencies with Desbordante","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PF"],"primary_cat":"cs.DB","authors_text":"Anton Chernikov, George Chernishev, Kirill Smirnov, Yurii Litvinov","submitted_at":"2026-08-03T14:46:21Z","abstract_excerpt":"Graph functional dependencies (GFD) are a recently-developed concept aimed at capturing both topological structures in graphs and functional dependencies between attributes. The process of verifying whether a given GFD holds over a particular graph is referred to as GFD validation. In this very computationally expensive problem, locating suitable subgraphs accounts for about 99% of the total run time. The concept's authors originally proposed a parallel scheme (algorithm), targeting specifically clusters of high-performance servers.\n  The goal of this study is to open GFD validation to a broad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02321","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/2608.02321/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.02321","created_at":"2026-08-04T02:11:48.609112+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.02321v1","created_at":"2026-08-04T02:11:48.609112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02321","created_at":"2026-08-04T02:11:48.609112+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYACE6IT2DM7","created_at":"2026-08-04T02:11:48.609112+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYACE6IT2DM77I47","created_at":"2026-08-04T02:11:48.609112+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYACE6IT","created_at":"2026-08-04T02:11:48.609112+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/ZYACE6IT2DM77I47TZ537FYEK5","json":"https://pith.science/pith/ZYACE6IT2DM77I47TZ537FYEK5.json","graph_json":"https://pith.science/api/pith-number/ZYACE6IT2DM77I47TZ537FYEK5/graph.json","events_json":"https://pith.science/api/pith-number/ZYACE6IT2DM77I47TZ537FYEK5/events.json","paper":"https://pith.science/paper/ZYACE6IT"},"agent_actions":{"view_html":"https://pith.science/pith/ZYACE6IT2DM77I47TZ537FYEK5","download_json":"https://pith.science/pith/ZYACE6IT2DM77I47TZ537FYEK5.json","view_paper":"https://pith.science/paper/ZYACE6IT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.02321&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYACE6IT2DM77I47TZ537FYEK5/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYACE6IT2DM77I47TZ537FYEK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYACE6IT2DM77I47TZ537FYEK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYACE6IT2DM77I47TZ537FYEK5/action/storage_attestation","attest_author":"https://pith.science/pith/ZYACE6IT2DM77I47TZ537FYEK5/action/author_attestation","sign_citation":"https://pith.science/pith/ZYACE6IT2DM77I47TZ537FYEK5/action/citation_signature","submit_replication":"https://pith.science/pith/ZYACE6IT2DM77I47TZ537FYEK5/action/replication_record"}},"created_at":"2026-08-04T02:11:48.609112+00:00","updated_at":"2026-08-04T02:11:48.609112+00:00"}