{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JWG7I3OWXHMYXF7M2DKHYCYQ4U","short_pith_number":"pith:JWG7I3OW","schema_version":"1.0","canonical_sha256":"4d8df46dd6b9d98b97ecd0d47c0b10e537df4e24aa620b67cf153b91ac50988c","source":{"kind":"arxiv","id":"2606.03299","version":1},"attestation_state":"computed","paper":{"title":"Classification of independent sets in signed Johnson graphs and applications to kissing arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Rustem Takhanov, Stanislav Yun","submitted_at":"2026-06-02T08:12:54Z","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"},"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":"2606.03299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-02T08:12:54Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"fd9036de842d4609c270d40e26cb0b9953a1a167def3d3864e3d1a5374cc563f","abstract_canon_sha256":"3ba0f3151427ee8323dd410d83da03fa65bcb890b5065938de8054ba13378900"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:54.372786Z","signature_b64":"YwHeaa890Rx4J0lpc1n5BPC+6ijMQGu5NbfU9O7ZnJYUvt6gdqzvLlSUky2cUW6eKAC/SuPbESlw481XwCU2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d8df46dd6b9d98b97ecd0d47c0b10e537df4e24aa620b67cf153b91ac50988c","last_reissued_at":"2026-06-03T01:05:54.372272Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:54.372272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification of independent sets in signed Johnson graphs and applications to kissing arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Rustem Takhanov, Stanislav Yun","submitted_at":"2026-06-02T08:12:54Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03299","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/2606.03299/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":"2606.03299","created_at":"2026-06-03T01:05:54.372356+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.03299v1","created_at":"2026-06-03T01:05:54.372356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03299","created_at":"2026-06-03T01:05:54.372356+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWG7I3OWXHMY","created_at":"2026-06-03T01:05:54.372356+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWG7I3OWXHMYXF7M","created_at":"2026-06-03T01:05:54.372356+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWG7I3OW","created_at":"2026-06-03T01:05:54.372356+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/JWG7I3OWXHMYXF7M2DKHYCYQ4U","json":"https://pith.science/pith/JWG7I3OWXHMYXF7M2DKHYCYQ4U.json","graph_json":"https://pith.science/api/pith-number/JWG7I3OWXHMYXF7M2DKHYCYQ4U/graph.json","events_json":"https://pith.science/api/pith-number/JWG7I3OWXHMYXF7M2DKHYCYQ4U/events.json","paper":"https://pith.science/paper/JWG7I3OW"},"agent_actions":{"view_html":"https://pith.science/pith/JWG7I3OWXHMYXF7M2DKHYCYQ4U","download_json":"https://pith.science/pith/JWG7I3OWXHMYXF7M2DKHYCYQ4U.json","view_paper":"https://pith.science/paper/JWG7I3OW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.03299&json=true","fetch_graph":"https://pith.science/api/pith-number/JWG7I3OWXHMYXF7M2DKHYCYQ4U/graph.json","fetch_events":"https://pith.science/api/pith-number/JWG7I3OWXHMYXF7M2DKHYCYQ4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWG7I3OWXHMYXF7M2DKHYCYQ4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWG7I3OWXHMYXF7M2DKHYCYQ4U/action/storage_attestation","attest_author":"https://pith.science/pith/JWG7I3OWXHMYXF7M2DKHYCYQ4U/action/author_attestation","sign_citation":"https://pith.science/pith/JWG7I3OWXHMYXF7M2DKHYCYQ4U/action/citation_signature","submit_replication":"https://pith.science/pith/JWG7I3OWXHMYXF7M2DKHYCYQ4U/action/replication_record"}},"created_at":"2026-06-03T01:05:54.372356+00:00","updated_at":"2026-06-03T01:05:54.372356+00:00"}