{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XGSIUPSIPKJB2S7Q3XFYHMEWMC","short_pith_number":"pith:XGSIUPSI","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"},"canonical_sha256":"b9a48a3e487a921d4bf0ddcb83b09660afef2c430ec75aabd63744b413aa8f27","source":{"kind":"arxiv","id":"2604.26333","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26333","created_at":"2026-06-09T01:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26333v2","created_at":"2026-06-09T01:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26333","created_at":"2026-06-09T01:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"XGSIUPSIPKJB","created_at":"2026-06-09T01:05:18Z"},{"alias_kind":"pith_short_16","alias_value":"XGSIUPSIPKJB2S7Q","created_at":"2026-06-09T01:05:18Z"},{"alias_kind":"pith_short_8","alias_value":"XGSIUPSI","created_at":"2026-06-09T01:05:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XGSIUPSIPKJB2S7Q3XFYHMEWMC","target":"record","payload":{"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"},"canonical_sha256":"b9a48a3e487a921d4bf0ddcb83b09660afef2c430ec75aabd63744b413aa8f27","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"},"source_kind":"arxiv","source_id":"2604.26333","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T01:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5WVRs8kuNSWJAsnRV4baLTdSUC8PfvoPNomByiwHHZ+a9NCZGcmljZhLcEHqO/8vwOoBwa3pcy5OkX5KZkKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:13:51.951686Z"},"content_sha256":"94ba4e27c148f5e798e720e0c65a09eceea626f8588b42c87ee12f39af4f7445","schema_version":"1.0","event_id":"sha256:94ba4e27c148f5e798e720e0c65a09eceea626f8588b42c87ee12f39af4f7445"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XGSIUPSIPKJB2S7Q3XFYHMEWMC","target":"graph","payload":{"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"},"verdict_id":"7f220e77-9807-4942-9061-14494796662a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T01:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ze8+AMwQCbL9UOPBmk1Ssw592a2U0BdAhmuO97TIntN8JtWwrFT9yKIosWjEJEISYumoy2O96kJkin+4IRm5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:13:51.952281Z"},"content_sha256":"e52d8511efa5352dbe416da6695d5ddc2e907622ec4bdeacf1cd8312ac0f86b4","schema_version":"1.0","event_id":"sha256:e52d8511efa5352dbe416da6695d5ddc2e907622ec4bdeacf1cd8312ac0f86b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC/bundle.json","state_url":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T14:13:51Z","links":{"resolver":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC","bundle":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC/bundle.json","state":"https://pith.science/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGSIUPSIPKJB2S7Q3XFYHMEWMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XGSIUPSIPKJB2S7Q3XFYHMEWMC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c48b1d4e403b71f3ef9a1ba7f38189eac516fbcb96ba4663921c17f377947f52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-04-29T06:32:34Z","title_canon_sha256":"34ac4316ccd6dd54aa0041ed63b0a7a06329c31d2cb323c1f73623ecb73ac83c"},"schema_version":"1.0","source":{"id":"2604.26333","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26333","created_at":"2026-06-09T01:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26333v2","created_at":"2026-06-09T01:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26333","created_at":"2026-06-09T01:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"XGSIUPSIPKJB","created_at":"2026-06-09T01:05:18Z"},{"alias_kind":"pith_short_16","alias_value":"XGSIUPSIPKJB2S7Q","created_at":"2026-06-09T01:05:18Z"},{"alias_kind":"pith_short_8","alias_value":"XGSIUPSI","created_at":"2026-06-09T01:05:18Z"}],"graph_snapshots":[{"event_id":"sha256:e52d8511efa5352dbe416da6695d5ddc2e907622ec4bdeacf1cd8312ac0f86b4","target":"graph","created_at":"2026-06-09T01:05:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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)."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Fixed-parameter graph languages generated by clause systems are learnable in the limit from positive data and membership queries."}],"snapshot_sha256":"c6b39314efee040693d79f36ce61ff9950981c89d0f4a6ae92bff32850df8fc1"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2604.26333/integrity.json","findings":[],"snapshot_sha256":"32be678a675d3c60ec50d7f1e644ff3ce03e63e32e9b8aacb49d9fb1cca2a482","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$,","authors_text":"Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uchida, Yusuke Suzuki","cross_cats":[],"headline":"Fixed-parameter graph languages generated by clause systems are learnable in the limit from positive data and membership queries.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-04-29T06:32:34Z","title":"Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.26333","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T12:51:25.636595Z","id":"7f220e77-9807-4942-9061-14494796662a","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Fixed-parameter graph languages generated by clause systems are learnable in the limit from positive data and membership queries.","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).","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."}},"verdict_id":"7f220e77-9807-4942-9061-14494796662a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:94ba4e27c148f5e798e720e0c65a09eceea626f8588b42c87ee12f39af4f7445","target":"record","created_at":"2026-06-09T01:05:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c48b1d4e403b71f3ef9a1ba7f38189eac516fbcb96ba4663921c17f377947f52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-04-29T06:32:34Z","title_canon_sha256":"34ac4316ccd6dd54aa0041ed63b0a7a06329c31d2cb323c1f73623ecb73ac83c"},"schema_version":"1.0","source":{"id":"2604.26333","kind":"arxiv","version":2}},"canonical_sha256":"b9a48a3e487a921d4bf0ddcb83b09660afef2c430ec75aabd63744b413aa8f27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9a48a3e487a921d4bf0ddcb83b09660afef2c430ec75aabd63744b413aa8f27","first_computed_at":"2026-06-09T01:05:18.294448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:18.294448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UJmmDife9AOrmMJ1g04ZK0n/4+e8iu5nO6IjCgp9557e0l9IeYxfmgC1VEwo0Aod/GJGPxa2ZE29M7fO2xCIBg==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:18.295054Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.26333","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94ba4e27c148f5e798e720e0c65a09eceea626f8588b42c87ee12f39af4f7445","sha256:e52d8511efa5352dbe416da6695d5ddc2e907622ec4bdeacf1cd8312ac0f86b4"],"state_sha256":"b27b9bc3de9471f010cd7a139716025d63a31968dd414c3f960b00b14821b78f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A//bSEiqNmjRmvRMV3+S3JkcW7tszjisglc3qPdnHrU0vDi6VMiWlRoyLNNjcA0FQAONf8vdsz0j1xOweuQMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:13:51.955253Z","bundle_sha256":"29dbd666c8718380e983631f470e90228e0edac9be5a3916ab1376567be68696"}}