{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ERH56G5OAMP4NRW6SVDL35LZSL","short_pith_number":"pith:ERH56G5O","canonical_record":{"source":{"id":"1302.1176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-05T20:12:06Z","cross_cats_sorted":[],"title_canon_sha256":"7aac2ed96809a4eab9734e030537e7b66dc5405b4d0cc22ec08f9327d1ad0d2d","abstract_canon_sha256":"369c858c5489206f6421c16b603a6ea2ff8994e014d40457e8f499d2868a49aa"},"schema_version":"1.0"},"canonical_sha256":"244fdf1bae031fc6c6de9546bdf57992fb3891cd2c6c635c1db25d7be0333033","source":{"kind":"arxiv","id":"1302.1176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1176","created_at":"2026-05-18T03:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1176v1","created_at":"2026-05-18T03:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1176","created_at":"2026-05-18T03:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"ERH56G5OAMP4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ERH56G5OAMP4NRW6","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ERH56G5O","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ERH56G5OAMP4NRW6SVDL35LZSL","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-05T20:12:06Z","cross_cats_sorted":[],"title_canon_sha256":"7aac2ed96809a4eab9734e030537e7b66dc5405b4d0cc22ec08f9327d1ad0d2d","abstract_canon_sha256":"369c858c5489206f6421c16b603a6ea2ff8994e014d40457e8f499d2868a49aa"},"schema_version":"1.0"},"canonical_sha256":"244fdf1bae031fc6c6de9546bdf57992fb3891cd2c6c635c1db25d7be0333033","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:25.999365Z","signature_b64":"Axs4Qd/j/RBHDyRygv52EX6lJxwucDPVI0OaXDLNk9kWO4ANelJO1AkitXcP4Xk6dR4TEumgxsHbQ4ziIOUdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"244fdf1bae031fc6c6de9546bdf57992fb3891cd2c6c635c1db25d7be0333033","last_reissued_at":"2026-05-18T03:34:25.998874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:25.998874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1176","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-18T03:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMCV6NaonzXBbZqbz8Pl61fF/Y1nuSVPX/Q4TblXMeNcGt2qwq4ChA/w61aN69T1CCxojbwnQysCG8FrNKrHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:56:04.300069Z"},"content_sha256":"4e0e8a7cbc8947b450b0ada6ffe39c3c32aabc5c3d88d316a748833f4995242e","schema_version":"1.0","event_id":"sha256:4e0e8a7cbc8947b450b0ada6ffe39c3c32aabc5c3d88d316a748833f4995242e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ERH56G5OAMP4NRW6SVDL35LZSL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Integer Sequences to Block Designs via Counting Walks in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ernesto Estrada, Jos\\'e A. de la Pe\\~na","submitted_at":"2013-02-05T20:12:06Z","abstract_excerpt":"We define numbers of the type Oj(N) and Ej(N) and the corresponding integer sequences. We prove that these integer sequences, e.g., SO(N) and SE(N) correspond to the number of odd and even walks in complete graphs. We then prove that there is a unique family of graphs which have exactly the same sequence of odd walks between connected nodes and of even walks between pairs of nodes at distance two, respectively. These graphs are obtained as the Kronecker product. We show that they are the incidence graphs of block designs, are distance-regular and Ramanujan graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1176","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-18T03:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VvE2Sgx2/yhr83xugfwV3r/mGsgXG90EjjhIS9XUp7gRRPSS/MPQNoo3YK4WXMKBgoczHqudWv6gmhyr0deXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:56:04.300427Z"},"content_sha256":"1c59a1dcca654e8da558919a3092289631bb19fd73ac1b6bfb2f3e898ae10059","schema_version":"1.0","event_id":"sha256:1c59a1dcca654e8da558919a3092289631bb19fd73ac1b6bfb2f3e898ae10059"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERH56G5OAMP4NRW6SVDL35LZSL/bundle.json","state_url":"https://pith.science/pith/ERH56G5OAMP4NRW6SVDL35LZSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERH56G5OAMP4NRW6SVDL35LZSL/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-26T12:56:04Z","links":{"resolver":"https://pith.science/pith/ERH56G5OAMP4NRW6SVDL35LZSL","bundle":"https://pith.science/pith/ERH56G5OAMP4NRW6SVDL35LZSL/bundle.json","state":"https://pith.science/pith/ERH56G5OAMP4NRW6SVDL35LZSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERH56G5OAMP4NRW6SVDL35LZSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ERH56G5OAMP4NRW6SVDL35LZSL","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":"369c858c5489206f6421c16b603a6ea2ff8994e014d40457e8f499d2868a49aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-05T20:12:06Z","title_canon_sha256":"7aac2ed96809a4eab9734e030537e7b66dc5405b4d0cc22ec08f9327d1ad0d2d"},"schema_version":"1.0","source":{"id":"1302.1176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1176","created_at":"2026-05-18T03:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1176v1","created_at":"2026-05-18T03:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1176","created_at":"2026-05-18T03:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"ERH56G5OAMP4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ERH56G5OAMP4NRW6","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ERH56G5O","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:1c59a1dcca654e8da558919a3092289631bb19fd73ac1b6bfb2f3e898ae10059","target":"graph","created_at":"2026-05-18T03:34:25Z","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 define numbers of the type Oj(N) and Ej(N) and the corresponding integer sequences. We prove that these integer sequences, e.g., SO(N) and SE(N) correspond to the number of odd and even walks in complete graphs. We then prove that there is a unique family of graphs which have exactly the same sequence of odd walks between connected nodes and of even walks between pairs of nodes at distance two, respectively. These graphs are obtained as the Kronecker product. We show that they are the incidence graphs of block designs, are distance-regular and Ramanujan graphs.","authors_text":"Ernesto Estrada, Jos\\'e A. de la Pe\\~na","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-05T20:12:06Z","title":"From Integer Sequences to Block Designs via Counting Walks in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1176","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:4e0e8a7cbc8947b450b0ada6ffe39c3c32aabc5c3d88d316a748833f4995242e","target":"record","created_at":"2026-05-18T03:34:25Z","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":"369c858c5489206f6421c16b603a6ea2ff8994e014d40457e8f499d2868a49aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-05T20:12:06Z","title_canon_sha256":"7aac2ed96809a4eab9734e030537e7b66dc5405b4d0cc22ec08f9327d1ad0d2d"},"schema_version":"1.0","source":{"id":"1302.1176","kind":"arxiv","version":1}},"canonical_sha256":"244fdf1bae031fc6c6de9546bdf57992fb3891cd2c6c635c1db25d7be0333033","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"244fdf1bae031fc6c6de9546bdf57992fb3891cd2c6c635c1db25d7be0333033","first_computed_at":"2026-05-18T03:34:25.998874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:25.998874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Axs4Qd/j/RBHDyRygv52EX6lJxwucDPVI0OaXDLNk9kWO4ANelJO1AkitXcP4Xk6dR4TEumgxsHbQ4ziIOUdBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:25.999365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e0e8a7cbc8947b450b0ada6ffe39c3c32aabc5c3d88d316a748833f4995242e","sha256:1c59a1dcca654e8da558919a3092289631bb19fd73ac1b6bfb2f3e898ae10059"],"state_sha256":"03d9f61b289d7f74d28b6906bef1e51b426fa689359f70c44873fa31c1005aaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Gn8SypfJBZInepHfYEBSCELrvU8bd4KdqUKNcknmEam6lpj1lvXwtGa7yXauO6hvTnlvWrYWreGuEPNhSh0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:56:04.302533Z","bundle_sha256":"6a30a11018b6483ef82f9f04b63ad4850296cb2a760906e782686f9e9ad29d37"}}