{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:J6B6NXTGCWUEWDW5NOMMLK32F2","short_pith_number":"pith:J6B6NXTG","schema_version":"1.0","canonical_sha256":"4f83e6de6615a84b0edd6b98c5ab7a2e9ea068d5808cfb29cbd63e00dbd966ea","source":{"kind":"arxiv","id":"1008.0595","version":2},"attestation_state":"computed","paper":{"title":"Induced Subgraphs of Johnson Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffrey Shaw, Ramin Naimi","submitted_at":"2010-08-03T17:19:49Z","abstract_excerpt":"The Johnson graph J(n,N) is defined as the graph whose vertices are the n-subsets of the set {1,2,...,N}, where two vertices are adjacent if they share exactly n - 1 elements. Unlike Johnson graphs, induced subgraphs of Johnson graphs (JIS for short) do not seem to have been studied before. We give some necessary conditions and some sufficient conditions for a graph to be JIS, including: in a JIS graph, any two maximal cliques share at most two vertices; all trees, cycles, and complete graphs are JIS; disjoint unions and Cartesian products of JIS graphs are JIS; every JIS graph of order n is a"},"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":"1008.0595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-03T17:19:49Z","cross_cats_sorted":[],"title_canon_sha256":"4db8719b34160d27eb7fd66f3bce20f47f86c1cf60399be9a229e9974a7fc4bb","abstract_canon_sha256":"2dafa8164bbaad03a56864399c07d09fee0b952db7bef628a6ece9b7c7b40b52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:12.445108Z","signature_b64":"CFQ8U8vSEWELcEf7XLOr0SwEUkeNIBSOcEjGv+WOH4wR4RGyxwrS9Yoc8JWgDCnUI1VTfh6hv9jDiD0bKHc1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f83e6de6615a84b0edd6b98c5ab7a2e9ea068d5808cfb29cbd63e00dbd966ea","last_reissued_at":"2026-05-18T03:55:12.444434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:12.444434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced Subgraphs of Johnson Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffrey Shaw, Ramin Naimi","submitted_at":"2010-08-03T17:19:49Z","abstract_excerpt":"The Johnson graph J(n,N) is defined as the graph whose vertices are the n-subsets of the set {1,2,...,N}, where two vertices are adjacent if they share exactly n - 1 elements. Unlike Johnson graphs, induced subgraphs of Johnson graphs (JIS for short) do not seem to have been studied before. We give some necessary conditions and some sufficient conditions for a graph to be JIS, including: in a JIS graph, any two maximal cliques share at most two vertices; all trees, cycles, and complete graphs are JIS; disjoint unions and Cartesian products of JIS graphs are JIS; every JIS graph of order n is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0595","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1008.0595","created_at":"2026-05-18T03:55:12.444541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.0595v2","created_at":"2026-05-18T03:55:12.444541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0595","created_at":"2026-05-18T03:55:12.444541+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6B6NXTGCWUE","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6B6NXTGCWUEWDW5","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6B6NXTG","created_at":"2026-05-18T12:26:09.077623+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/J6B6NXTGCWUEWDW5NOMMLK32F2","json":"https://pith.science/pith/J6B6NXTGCWUEWDW5NOMMLK32F2.json","graph_json":"https://pith.science/api/pith-number/J6B6NXTGCWUEWDW5NOMMLK32F2/graph.json","events_json":"https://pith.science/api/pith-number/J6B6NXTGCWUEWDW5NOMMLK32F2/events.json","paper":"https://pith.science/paper/J6B6NXTG"},"agent_actions":{"view_html":"https://pith.science/pith/J6B6NXTGCWUEWDW5NOMMLK32F2","download_json":"https://pith.science/pith/J6B6NXTGCWUEWDW5NOMMLK32F2.json","view_paper":"https://pith.science/paper/J6B6NXTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.0595&json=true","fetch_graph":"https://pith.science/api/pith-number/J6B6NXTGCWUEWDW5NOMMLK32F2/graph.json","fetch_events":"https://pith.science/api/pith-number/J6B6NXTGCWUEWDW5NOMMLK32F2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6B6NXTGCWUEWDW5NOMMLK32F2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6B6NXTGCWUEWDW5NOMMLK32F2/action/storage_attestation","attest_author":"https://pith.science/pith/J6B6NXTGCWUEWDW5NOMMLK32F2/action/author_attestation","sign_citation":"https://pith.science/pith/J6B6NXTGCWUEWDW5NOMMLK32F2/action/citation_signature","submit_replication":"https://pith.science/pith/J6B6NXTGCWUEWDW5NOMMLK32F2/action/replication_record"}},"created_at":"2026-05-18T03:55:12.444541+00:00","updated_at":"2026-05-18T03:55:12.444541+00:00"}