{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CLRZMXQ6BHULZZ7L533TRR2GZ5","short_pith_number":"pith:CLRZMXQ6","canonical_record":{"source":{"id":"1503.07357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-25T12:26:16Z","cross_cats_sorted":[],"title_canon_sha256":"356335682a6c57679ac1b495f12150346592844301bfd307784a48d5066116cc","abstract_canon_sha256":"065f9b72bf7f384c6669277c9405c37bc19facf98e3105daf237c74c303fbaee"},"schema_version":"1.0"},"canonical_sha256":"12e3965e1e09e8bce7ebeef738c746cf40d43c6263d9405b58cb4b882bb15bf7","source":{"kind":"arxiv","id":"1503.07357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07357","created_at":"2026-05-18T02:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07357v1","created_at":"2026-05-18T02:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07357","created_at":"2026-05-18T02:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"CLRZMXQ6BHUL","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CLRZMXQ6BHULZZ7L","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CLRZMXQ6","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CLRZMXQ6BHULZZ7L533TRR2GZ5","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-25T12:26:16Z","cross_cats_sorted":[],"title_canon_sha256":"356335682a6c57679ac1b495f12150346592844301bfd307784a48d5066116cc","abstract_canon_sha256":"065f9b72bf7f384c6669277c9405c37bc19facf98e3105daf237c74c303fbaee"},"schema_version":"1.0"},"canonical_sha256":"12e3965e1e09e8bce7ebeef738c746cf40d43c6263d9405b58cb4b882bb15bf7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:21.289615Z","signature_b64":"w9j0r3LTSdK2IZrviLnyNYnurAxk0FoCVcjBycjL8QSOxnLZwH4K6cSXW6wIiG0ZKCbtlFVkB6V78oEujXfjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12e3965e1e09e8bce7ebeef738c746cf40d43c6263d9405b58cb4b882bb15bf7","last_reissued_at":"2026-05-18T02:20:21.288989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:21.288989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07357","source_version":1,"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-18T02:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVYYtRsk1rWCuhq/uWLnHTAdG3FzSdrWa61TxEqwePsdwCyztilEh8KEREKsTCttDAWG0BgWjxmWaq0SKy+fBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:36:21.028533Z"},"content_sha256":"f1482397a6b4ff18f81d3618e6c57b943178122ea6f134bf792f074a796164fa","schema_version":"1.0","event_id":"sha256:f1482397a6b4ff18f81d3618e6c57b943178122ea6f134bf792f074a796164fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CLRZMXQ6BHULZZ7L533TRR2GZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Searching for Large Circulant Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hebert Perez-Roses, Joe Ryan, Ramiro Feria-Puron","submitted_at":"2015-03-25T12:26:16Z","abstract_excerpt":"We address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and then we describe and implement a computer-based method to find large circulant graphs with given parameters. For several combinations of degree and diameter, our algorithm produces the largest known circulant graphs. We summarize our findings in a table, up to degree 15 and diameter 10, and we perform a statistical analysis of this table, which can be useful for evaluating the performance of our methods, as well as o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07357","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":""},"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-18T02:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TacU72D7XXnafrCJZOpdJR6UyiXhKQvjBpGxGJJuoVJ6gasbi+oQC0Sa90f14A2Z51KsRCvA2Cz9vdPyG1p6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:36:21.028880Z"},"content_sha256":"46bd2c437383fb82e8f3af0889842350c1cc9227b95967622367961617b645d8","schema_version":"1.0","event_id":"sha256:46bd2c437383fb82e8f3af0889842350c1cc9227b95967622367961617b645d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLRZMXQ6BHULZZ7L533TRR2GZ5/bundle.json","state_url":"https://pith.science/pith/CLRZMXQ6BHULZZ7L533TRR2GZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLRZMXQ6BHULZZ7L533TRR2GZ5/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-22T02:36:21Z","links":{"resolver":"https://pith.science/pith/CLRZMXQ6BHULZZ7L533TRR2GZ5","bundle":"https://pith.science/pith/CLRZMXQ6BHULZZ7L533TRR2GZ5/bundle.json","state":"https://pith.science/pith/CLRZMXQ6BHULZZ7L533TRR2GZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLRZMXQ6BHULZZ7L533TRR2GZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CLRZMXQ6BHULZZ7L533TRR2GZ5","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":"065f9b72bf7f384c6669277c9405c37bc19facf98e3105daf237c74c303fbaee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-25T12:26:16Z","title_canon_sha256":"356335682a6c57679ac1b495f12150346592844301bfd307784a48d5066116cc"},"schema_version":"1.0","source":{"id":"1503.07357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07357","created_at":"2026-05-18T02:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07357v1","created_at":"2026-05-18T02:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07357","created_at":"2026-05-18T02:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"CLRZMXQ6BHUL","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CLRZMXQ6BHULZZ7L","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CLRZMXQ6","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:46bd2c437383fb82e8f3af0889842350c1cc9227b95967622367961617b645d8","target":"graph","created_at":"2026-05-18T02:20:21Z","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 address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and then we describe and implement a computer-based method to find large circulant graphs with given parameters. For several combinations of degree and diameter, our algorithm produces the largest known circulant graphs. We summarize our findings in a table, up to degree 15 and diameter 10, and we perform a statistical analysis of this table, which can be useful for evaluating the performance of our methods, as well as o","authors_text":"Hebert Perez-Roses, Joe Ryan, Ramiro Feria-Puron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-25T12:26:16Z","title":"Searching for Large Circulant Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07357","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:f1482397a6b4ff18f81d3618e6c57b943178122ea6f134bf792f074a796164fa","target":"record","created_at":"2026-05-18T02:20:21Z","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":"065f9b72bf7f384c6669277c9405c37bc19facf98e3105daf237c74c303fbaee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-25T12:26:16Z","title_canon_sha256":"356335682a6c57679ac1b495f12150346592844301bfd307784a48d5066116cc"},"schema_version":"1.0","source":{"id":"1503.07357","kind":"arxiv","version":1}},"canonical_sha256":"12e3965e1e09e8bce7ebeef738c746cf40d43c6263d9405b58cb4b882bb15bf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12e3965e1e09e8bce7ebeef738c746cf40d43c6263d9405b58cb4b882bb15bf7","first_computed_at":"2026-05-18T02:20:21.288989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:21.288989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w9j0r3LTSdK2IZrviLnyNYnurAxk0FoCVcjBycjL8QSOxnLZwH4K6cSXW6wIiG0ZKCbtlFVkB6V78oEujXfjBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:21.289615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1482397a6b4ff18f81d3618e6c57b943178122ea6f134bf792f074a796164fa","sha256:46bd2c437383fb82e8f3af0889842350c1cc9227b95967622367961617b645d8"],"state_sha256":"e60917c9e8aa128c568bbad14b532095d0486b70d0d3dfa12d9bbe3b18721713"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cO9Jwift8qbbgbt291t2oMcm4si3huXV0LylyM3IL3iAo0zkVGm9L/x7zxICYlffyiFlL7I03i/NTx5XpPmhAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T02:36:21.032190Z","bundle_sha256":"c1a78f0a4a29bd054e9d8c5cf12ba99fa90ec78c8da6065633b0e6a16db44632"}}