{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:C3LF7NXLM34T2VHRO7FXXRWSVD","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":"4e2f3a0731b6177bc94c95004407b21bcfcc005a0405d0413bb120cdea522ca1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-31T01:52:40Z","title_canon_sha256":"9d4097d0fcf0a49b653679b6569176bd73152adbc2c668370ec3dd652ac06321"},"schema_version":"1.0","source":{"id":"2208.00335","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.00335","created_at":"2026-06-02T01:03:27Z"},{"alias_kind":"arxiv_version","alias_value":"2208.00335v5","created_at":"2026-06-02T01:03:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.00335","created_at":"2026-06-02T01:03:27Z"},{"alias_kind":"pith_short_12","alias_value":"C3LF7NXLM34T","created_at":"2026-06-02T01:03:27Z"},{"alias_kind":"pith_short_16","alias_value":"C3LF7NXLM34T2VHR","created_at":"2026-06-02T01:03:27Z"},{"alias_kind":"pith_short_8","alias_value":"C3LF7NXL","created_at":"2026-06-02T01:03:27Z"}],"graph_snapshots":[{"event_id":"sha256:207ded9bf8c967881bea53378f83e8a680f36c6f2572006abd1992834cb6125f","target":"graph","created_at":"2026-06-02T01:03:27Z","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":"ChatIPC is a lightweight incremental symbolic learning system that extracts ordered token-transition rules from text, enriches them with definition-based expansion, and constructs responses by similarity-guided candidate selection, operating over a token graph rather than a conventional classifier."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That similarity-guided selection on the token-transition graph, combined with definition expansion, will reliably produce coherent and useful responses (assumed without stated validation or comparison to baselines)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ChatIPC extracts ordered token-transition rules from text via incremental learning and definition expansion, then constructs responses through similarity-guided selection on a token graph."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"ChatIPC extracts ordered token-transition rules from text and builds responses by similarity selection on a token graph."}],"snapshot_sha256":"8255a6ee4290c03d3bcde0b5ae1e7e04dfea70146bcd39dcd4624b229efe9a82"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.00335/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Rule extraction is a central problem in interpretable machine learning because it seeks to convert opaque predictive behavior into human-readable symbolic structure. This paper presents Chat Incremental Pattern Constructor (ChatIPC), a lightweight incremental symbolic learning system that extracts ordered token-transition rules from text, enriches them with definition-based expansion, and constructs responses by similarity-guided candidate selection. The system may be viewed as a rule extractor operating over a token graph rather than a conventional classifier. I formalize the knowledge base, ","authors_text":"Caleb Princewill Nwokocha","cross_cats":[],"headline":"ChatIPC extracts ordered token-transition rules from text and builds responses by similarity selection on a token graph.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-31T01:52:40Z","title":"Rule Extraction in Machine Learning: Chat Incremental Pattern Constructor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.00335","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-24T11:17:48.771747Z","id":"694b419c-de0c-43ec-9db6-efded1f77a6a","model_set":{"reader":"grok-4.3"},"one_line_summary":"ChatIPC extracts ordered token-transition rules from text via incremental learning and definition expansion, then constructs responses through similarity-guided selection on a token graph.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"ChatIPC extracts ordered token-transition rules from text and builds responses by similarity selection on a token graph.","strongest_claim":"ChatIPC is a lightweight incremental symbolic learning system that extracts ordered token-transition rules from text, enriches them with definition-based expansion, and constructs responses by similarity-guided candidate selection, operating over a token graph rather than a conventional classifier.","weakest_assumption":"That similarity-guided selection on the token-transition graph, combined with definition expansion, will reliably produce coherent and useful responses (assumed without stated validation or comparison to baselines)."}},"verdict_id":"694b419c-de0c-43ec-9db6-efded1f77a6a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1f1b22b0113e6ec45065c9ffb709e31064d6d0e3041dd0298d6d9aa77f143e78","target":"record","created_at":"2026-06-02T01:03:27Z","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":"4e2f3a0731b6177bc94c95004407b21bcfcc005a0405d0413bb120cdea522ca1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-31T01:52:40Z","title_canon_sha256":"9d4097d0fcf0a49b653679b6569176bd73152adbc2c668370ec3dd652ac06321"},"schema_version":"1.0","source":{"id":"2208.00335","kind":"arxiv","version":5}},"canonical_sha256":"16d65fb6eb66f93d54f177cb7bc6d2a8d550f4fc4d0804171fb2849cdb9cc003","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16d65fb6eb66f93d54f177cb7bc6d2a8d550f4fc4d0804171fb2849cdb9cc003","first_computed_at":"2026-06-02T01:03:27.769592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:27.769592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lrh1TV3sXTrS70v6yRl9H8uT1WfyOUbRfuVtIRmxzbRBaY8fYR1fziX+IfTVV9ifmrGzdl23BmuEQnykitZrCQ==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:27.770033Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.00335","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f1b22b0113e6ec45065c9ffb709e31064d6d0e3041dd0298d6d9aa77f143e78","sha256:207ded9bf8c967881bea53378f83e8a680f36c6f2572006abd1992834cb6125f"],"state_sha256":"350af56cf8e2cfdcdc7f02471738482da9d08af2b647dae85356bf1346df4772"}