{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WNAZDHTTHWGHKU26C4YY57QW44","short_pith_number":"pith:WNAZDHTT","canonical_record":{"source":{"id":"1409.3520","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-11T18:06:35Z","cross_cats_sorted":[],"title_canon_sha256":"679e76192669f65a883814f12ac07ea5aaa6238a762036ce9b6399c80bfb80e4","abstract_canon_sha256":"e841e9afba90517edee4928b76a3aaafc29f674658bf9aa28a86d703007ea690"},"schema_version":"1.0"},"canonical_sha256":"b341919e733d8c75535e17318efe16e73a44f9eae48d54c187f7fe726e7511ea","source":{"kind":"arxiv","id":"1409.3520","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3520","created_at":"2026-05-18T00:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3520v4","created_at":"2026-05-18T00:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3520","created_at":"2026-05-18T00:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"WNAZDHTTHWGH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WNAZDHTTHWGHKU26","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WNAZDHTT","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WNAZDHTTHWGHKU26C4YY57QW44","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3520","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-11T18:06:35Z","cross_cats_sorted":[],"title_canon_sha256":"679e76192669f65a883814f12ac07ea5aaa6238a762036ce9b6399c80bfb80e4","abstract_canon_sha256":"e841e9afba90517edee4928b76a3aaafc29f674658bf9aa28a86d703007ea690"},"schema_version":"1.0"},"canonical_sha256":"b341919e733d8c75535e17318efe16e73a44f9eae48d54c187f7fe726e7511ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:24.196661Z","signature_b64":"2xIGU52IOzIvJHxV/+CCf7ftDQYmhHoVktg80D2cB0Otj7EJT+m/kenFwk1whkrQ1ITrLNWvIlVa23staSPNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b341919e733d8c75535e17318efe16e73a44f9eae48d54c187f7fe726e7511ea","last_reissued_at":"2026-05-18T00:16:24.196016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:24.196016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3520","source_version":4,"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-05-18T00:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XWXQJBw4n20Q1UIp2kWAEebFR4J8V5EGeokVx0HM2urbym2F+sxn3VF9NpZ5Lu/HLJKO5TxbxKZhsYJ08/r0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:17:01.799077Z"},"content_sha256":"b0b6cc4f4806c10525f17e4936f5ce33c886d8b91026455bb7e889732ffefba8","schema_version":"1.0","event_id":"sha256:b0b6cc4f4806c10525f17e4936f5ce33c886d8b91026455bb7e889732ffefba8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WNAZDHTTHWGHKU26C4YY57QW44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New strongly regular graphs derived from the G2(4) graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thomas Jenrich","submitted_at":"2014-09-11T18:06:35Z","abstract_excerpt":"We consider simple loopless finite undirected graphs. Such a graph is called strongly regular with parameter set (v,k,l,m), for short a srg(v,k,l,m), iff it has exactly v vertices, each of them has exactly k neighbours, and the number of common neighbours of any two different vertices is l if they are neighbours and m otherwise.\n  The G2(4) graph is a well-known srg(416,100,36,20). In this article, we explicitly construct it and a certain subgraph E induced by 320 vertices in the same way as in an older article by this author. We discover some interesting properties of E and derive five strong"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3520","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h76Eu3pWbYUFvX5giI9BiTSkF2MP7XVlC9JnicXz8riBkWWJCUasmWwzY3GCsraTtHsrRhl5gBsvj23rx9KVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:17:01.799585Z"},"content_sha256":"701a00924da4cd65b8b76bc3bf803db68d1230c8ca5075f7f8eb1d02f1a3ad84","schema_version":"1.0","event_id":"sha256:701a00924da4cd65b8b76bc3bf803db68d1230c8ca5075f7f8eb1d02f1a3ad84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNAZDHTTHWGHKU26C4YY57QW44/bundle.json","state_url":"https://pith.science/pith/WNAZDHTTHWGHKU26C4YY57QW44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNAZDHTTHWGHKU26C4YY57QW44/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-24T06:17:01Z","links":{"resolver":"https://pith.science/pith/WNAZDHTTHWGHKU26C4YY57QW44","bundle":"https://pith.science/pith/WNAZDHTTHWGHKU26C4YY57QW44/bundle.json","state":"https://pith.science/pith/WNAZDHTTHWGHKU26C4YY57QW44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNAZDHTTHWGHKU26C4YY57QW44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WNAZDHTTHWGHKU26C4YY57QW44","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":"e841e9afba90517edee4928b76a3aaafc29f674658bf9aa28a86d703007ea690","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-11T18:06:35Z","title_canon_sha256":"679e76192669f65a883814f12ac07ea5aaa6238a762036ce9b6399c80bfb80e4"},"schema_version":"1.0","source":{"id":"1409.3520","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3520","created_at":"2026-05-18T00:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3520v4","created_at":"2026-05-18T00:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3520","created_at":"2026-05-18T00:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"WNAZDHTTHWGH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WNAZDHTTHWGHKU26","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WNAZDHTT","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:701a00924da4cd65b8b76bc3bf803db68d1230c8ca5075f7f8eb1d02f1a3ad84","target":"graph","created_at":"2026-05-18T00:16:24Z","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"},"paper":{"abstract_excerpt":"We consider simple loopless finite undirected graphs. Such a graph is called strongly regular with parameter set (v,k,l,m), for short a srg(v,k,l,m), iff it has exactly v vertices, each of them has exactly k neighbours, and the number of common neighbours of any two different vertices is l if they are neighbours and m otherwise.\n  The G2(4) graph is a well-known srg(416,100,36,20). In this article, we explicitly construct it and a certain subgraph E induced by 320 vertices in the same way as in an older article by this author. We discover some interesting properties of E and derive five strong","authors_text":"Thomas Jenrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-11T18:06:35Z","title":"New strongly regular graphs derived from the G2(4) graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3520","kind":"arxiv","version":4},"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:b0b6cc4f4806c10525f17e4936f5ce33c886d8b91026455bb7e889732ffefba8","target":"record","created_at":"2026-05-18T00:16:24Z","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":"e841e9afba90517edee4928b76a3aaafc29f674658bf9aa28a86d703007ea690","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-11T18:06:35Z","title_canon_sha256":"679e76192669f65a883814f12ac07ea5aaa6238a762036ce9b6399c80bfb80e4"},"schema_version":"1.0","source":{"id":"1409.3520","kind":"arxiv","version":4}},"canonical_sha256":"b341919e733d8c75535e17318efe16e73a44f9eae48d54c187f7fe726e7511ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b341919e733d8c75535e17318efe16e73a44f9eae48d54c187f7fe726e7511ea","first_computed_at":"2026-05-18T00:16:24.196016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:24.196016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2xIGU52IOzIvJHxV/+CCf7ftDQYmhHoVktg80D2cB0Otj7EJT+m/kenFwk1whkrQ1ITrLNWvIlVa23staSPNDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:24.196661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3520","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0b6cc4f4806c10525f17e4936f5ce33c886d8b91026455bb7e889732ffefba8","sha256:701a00924da4cd65b8b76bc3bf803db68d1230c8ca5075f7f8eb1d02f1a3ad84"],"state_sha256":"c21d48daddd93c3a28a9f4cd66a3a6b4e93b17f622d2b8bd3699c8e2b0cd853a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WeaQYXBr+IRieJnZvhbVCviTf8grkRntUhLa4a5YYFkm370pScnrMkgZCGxeu9EuPujG5qKQlP/crRMUBW2tAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:17:01.802085Z","bundle_sha256":"1fab60e2b4623a6a534d710c60ff237ed5100388067b517d3de02890fb8ae7bb"}}