{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XGSIUPSIPKJB2S7Q3XFYHMEWMC","short_pith_number":"pith:XGSIUPSI","schema_version":"1.0","canonical_sha256":"b9a48a3e487a921d4bf0ddcb83b09660afef2c430ec75aabd63744b413aa8f27","source":{"kind":"arxiv","id":"2604.26333","version":2},"attestation_state":"computed","paper":{"title":"Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Fixed-parameter graph languages generated by clause systems are learnable in the limit from positive data and membership queries.","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uchida, Yusuke Suzuki","submitted_at":"2026-04-29T06:32:34Z","abstract_excerpt":"Distributional learning provides a useful framework for studying the learnability of structured languages from positive data. In this paper, we extend this framework to graph languages generated by fixed-interface clause systems (FICSs).\n  We formulate FICSs explicitly and study the corresponding learning problem under positive presentations and membership queries. We consider a bounded class of graph languages satisfying the finite context property (FCP) under a bounded-degree assumption. The bounds are expressed by the degree bound $\\Delta$ together with five structural parameters $m,s,t,w$,"},"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":"2604.26333","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-04-29T06:32:34Z","cross_cats_sorted":[],"title_canon_sha256":"34ac4316ccd6dd54aa0041ed63b0a7a06329c31d2cb323c1f73623ecb73ac83c","abstract_canon_sha256":"c48b1d4e403b71f3ef9a1ba7f38189eac516fbcb96ba4663921c17f377947f52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:18.295054Z","signature_b64":"UJmmDife9AOrmMJ1g04ZK0n/4+e8iu5nO6IjCgp9557e0l9IeYxfmgC1VEwo0Aod/GJGPxa2ZE29M7fO2xCIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a48a3e487a921d4bf0ddcb83b09660afef2c430ec75aabd63744b413aa8f27","last_reissued_at":"2026-06-09T01:05:18.294448Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:18.294448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Fixed-parameter graph languages generated by clause systems are learnable in the limit from positive data and membership queries.","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uchida, Yusuke Suzuki","submitted_at":"2026-04-29T06:32:34Z","abstract_excerpt":"Distributional learning provides a useful framework for studying the learnability of structured languages from positive data. In this paper, we extend this framework to graph languages generated by fixed-interface clause systems (FICSs).\n  We formulate FICSs explicitly and study the corresponding learning problem under positive presentations and membership queries. We consider a bounded class of graph languages satisfying the finite context property (FCP) under a bounded-degree assumption. The bounds are expressed by the degree bound $\\Delta$ together with five structural parameters $m,s,t,w$,"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Hence, for every fixed parameter tuple (Δ,m,s,t,w,d), the target language is identifiable in the limit from positive data and membership queries. We also prove that the learner has polynomial-time update on FICSL^FCP_Δ(m,s,t,w,d).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The target language belongs to the bounded class FICSL^FCP_Δ(m,s,t,w,d) that satisfies the finite context property under the bounded-degree assumption.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Graph languages from fixed-interface clause systems with the finite context property are identifiable in the limit from positive data and membership queries by a polynomial-time learner for any fixed bound tuple (Δ,m,s,t,w,d).","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Fixed-parameter graph languages generated by clause systems are learnable in the limit from positive data and membership queries.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c6b39314efee040693d79f36ce61ff9950981c89d0f4a6ae92bff32850df8fc1"},"source":{"id":"2604.26333","kind":"arxiv","version":2},"verdict":{"id":"7f220e77-9807-4942-9061-14494796662a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T12:51:25.636595Z","strongest_claim":"Hence, for every fixed parameter tuple (Δ,m,s,t,w,d), the target language is identifiable in the limit from positive data and membership queries. We also prove that the learner has polynomial-time update on FICSL^FCP_Δ(m,s,t,w,d).","one_line_summary":"Graph languages from fixed-interface clause systems with the finite context property are identifiable in the limit from positive data and membership queries by a polynomial-time learner for any fixed bound tuple (Δ,m,s,t,w,d).","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The target language belongs to the bounded class FICSL^FCP_Δ(m,s,t,w,d) that satisfies the finite context property under the bounded-degree assumption.","pith_extraction_headline":"Fixed-parameter graph languages generated by clause systems are learnable in the limit from positive data and membership queries."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.26333/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T00:38:40.881092Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T20:13:47.209774Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"32be678a675d3c60ec50d7f1e644ff3ce03e63e32e9b8aacb49d9fb1cca2a482"},"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":"2604.26333","created_at":"2026-06-09T01:05:18.294549+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.26333v2","created_at":"2026-06-09T01:05:18.294549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26333","created_at":"2026-06-09T01:05:18.294549+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGSIUPSIPKJB","created_at":"2026-06-09T01:05:18.294549+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGSIUPSIPKJB2S7Q","created_at":"2026-06-09T01:05:18.294549+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGSIUPSI","created_at":"2026-06-09T01:05:18.294549+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/XGSIUPSIPKJB2S7Q3XFYHMEWMC","json":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC.json","graph_json":"https://pith.science/api/pith-number/XGSIUPSIPKJB2S7Q3XFYHMEWMC/graph.json","events_json":"https://pith.science/api/pith-number/XGSIUPSIPKJB2S7Q3XFYHMEWMC/events.json","paper":"https://pith.science/paper/XGSIUPSI"},"agent_actions":{"view_html":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC","download_json":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC.json","view_paper":"https://pith.science/paper/XGSIUPSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.26333&json=true","fetch_graph":"https://pith.science/api/pith-number/XGSIUPSIPKJB2S7Q3XFYHMEWMC/graph.json","fetch_events":"https://pith.science/api/pith-number/XGSIUPSIPKJB2S7Q3XFYHMEWMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC/action/storage_attestation","attest_author":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC/action/author_attestation","sign_citation":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC/action/citation_signature","submit_replication":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC/action/replication_record"}},"created_at":"2026-06-09T01:05:18.294549+00:00","updated_at":"2026-06-09T01:05:18.294549+00:00"}