{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JWG7I3OWXHMYXF7M2DKHYCYQ4U","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":"3ba0f3151427ee8323dd410d83da03fa65bcb890b5065938de8054ba13378900","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-02T08:12:54Z","title_canon_sha256":"fd9036de842d4609c270d40e26cb0b9953a1a167def3d3864e3d1a5374cc563f"},"schema_version":"1.0","source":{"id":"2606.03299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03299","created_at":"2026-06-03T01:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03299v1","created_at":"2026-06-03T01:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03299","created_at":"2026-06-03T01:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"JWG7I3OWXHMY","created_at":"2026-06-03T01:05:54Z"},{"alias_kind":"pith_short_16","alias_value":"JWG7I3OWXHMYXF7M","created_at":"2026-06-03T01:05:54Z"},{"alias_kind":"pith_short_8","alias_value":"JWG7I3OW","created_at":"2026-06-03T01:05:54Z"}],"graph_snapshots":[{"event_id":"sha256:74f40bbfdb21683e5593e1fd441568d6ca1cd07a17afc180e1cb470c76616755","target":"graph","created_at":"2026-06-03T01:05:54Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.03299/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Johnson graph are a family of graphs that play an important role in the theory of constant-weight codes, extremal combinatorics, and combinatorial geometry. We study signed analogues of classical Johnson graphs, denoted by $J_\\pm(n,k)$, whose vertices are vectors of the form $\\pm e_{i_1}\\pm\\cdots\\pm e_{i_k}$, where two vertices are adjacent whenever their dot product equals $k-1$. We are particularly interested in maximum independent sets in the case $k=4$. An example of such an independent set in $J_\\pm(n,4)$, which we call \\emph{classical}, is obtained by lifting an arbitrary optimal $(n,4,4","authors_text":"Rustem Takhanov, Stanislav Yun","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-02T08:12:54Z","title":"Classification of independent sets in signed Johnson graphs and applications to kissing arrangements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03299","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8cbb7894339107abf50d4276120cd2494c604ba1d639a3a2e5c236dd5e495e54","target":"record","created_at":"2026-06-03T01:05:54Z","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":"3ba0f3151427ee8323dd410d83da03fa65bcb890b5065938de8054ba13378900","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-02T08:12:54Z","title_canon_sha256":"fd9036de842d4609c270d40e26cb0b9953a1a167def3d3864e3d1a5374cc563f"},"schema_version":"1.0","source":{"id":"2606.03299","kind":"arxiv","version":1}},"canonical_sha256":"4d8df46dd6b9d98b97ecd0d47c0b10e537df4e24aa620b67cf153b91ac50988c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d8df46dd6b9d98b97ecd0d47c0b10e537df4e24aa620b67cf153b91ac50988c","first_computed_at":"2026-06-03T01:05:54.372272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:54.372272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YwHeaa890Rx4J0lpc1n5BPC+6ijMQGu5NbfU9O7ZnJYUvt6gdqzvLlSUky2cUW6eKAC/SuPbESlw481XwCU2Ag==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:54.372786Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.03299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cbb7894339107abf50d4276120cd2494c604ba1d639a3a2e5c236dd5e495e54","sha256:74f40bbfdb21683e5593e1fd441568d6ca1cd07a17afc180e1cb470c76616755"],"state_sha256":"320798e36700cd208641e057e7bc9e5598e4e6b570373f44ef54ae20b3e5c29d"}