{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BXZG456GWK54IWS564QMGYDHCU","short_pith_number":"pith:BXZG456G","canonical_record":{"source":{"id":"1205.5913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-26T19:44:45Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"f90c15f3b0c3af1cf4118a7b328ad7996a5d9a3e9d44e58c01e8b2c71fe55cd4","abstract_canon_sha256":"ecc33bf6e166d2e4f3a46a682e2dcddc6a5f3357320c8936030863659c195f53"},"schema_version":"1.0"},"canonical_sha256":"0df26e77c6b2bbc45a5df720c36067153027b0da630595f77131ec340e9a33a3","source":{"kind":"arxiv","id":"1205.5913","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.5913","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"1205.5913v2","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5913","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"BXZG456GWK54","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BXZG456GWK54IWS5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BXZG456G","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BXZG456GWK54IWS564QMGYDHCU","target":"record","payload":{"canonical_record":{"source":{"id":"1205.5913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-26T19:44:45Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"f90c15f3b0c3af1cf4118a7b328ad7996a5d9a3e9d44e58c01e8b2c71fe55cd4","abstract_canon_sha256":"ecc33bf6e166d2e4f3a46a682e2dcddc6a5f3357320c8936030863659c195f53"},"schema_version":"1.0"},"canonical_sha256":"0df26e77c6b2bbc45a5df720c36067153027b0da630595f77131ec340e9a33a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:20.210864Z","signature_b64":"Xs06lEwW+ylEe78n3TzKUEVngZDmjl1cGozbziy4WNrRBIpmDbyMVpQGb5cp3MfJDy/Mq94zL9SyJ+T17b2nDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0df26e77c6b2bbc45a5df720c36067153027b0da630595f77131ec340e9a33a3","last_reissued_at":"2026-05-18T03:12:20.210040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:20.210040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.5913","source_version":2,"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:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iy+DHEMJ/WS/RsrROcuDBGz2uegGsnHhkf+72JhE3hN461TClpLsK8MWpicnchkhd2FnHZ23sKwNCk/iGtZiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:18:32.691010Z"},"content_sha256":"932739383688ab058bbb3df3b7a7e6b76d690e3cb6e5e293a68e2cc9b4065d80","schema_version":"1.0","event_id":"sha256:932739383688ab058bbb3df3b7a7e6b76d690e3cb6e5e293a68e2cc9b4065d80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BXZG456GWK54IWS564QMGYDHCU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebraic characterizations of regularity properties in bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"A. Abiad, C. Dalf\\`o, M.A. Fiol","submitted_at":"2012-05-26T19:44:45Z","abstract_excerpt":"Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be computed from the spectrum) equals the average excess (the mean of the numbers of vertices at extremal distance from every vertex). The aim of this paper is to derive new characterizations of regularity and distance-regularity for the more restricted family of bipartite graphs. In this case, some characterizations of (bi)regular bipartite graphs are given in terms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5913","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"},"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:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4VSd1PG0DJ3UA2rk+1T2Tc90kfDgq+U9jceYBp7Kvyjhlq/RoLSy+0ogqxztw/dSB7m0hQyL8DcNSKp0H2RDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:18:32.691362Z"},"content_sha256":"0af1c5b824c22378be10096fbd3dd7763a5548465d7c42e3090e71fd08a80c7a","schema_version":"1.0","event_id":"sha256:0af1c5b824c22378be10096fbd3dd7763a5548465d7c42e3090e71fd08a80c7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXZG456GWK54IWS564QMGYDHCU/bundle.json","state_url":"https://pith.science/pith/BXZG456GWK54IWS564QMGYDHCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXZG456GWK54IWS564QMGYDHCU/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-23T04:18:32Z","links":{"resolver":"https://pith.science/pith/BXZG456GWK54IWS564QMGYDHCU","bundle":"https://pith.science/pith/BXZG456GWK54IWS564QMGYDHCU/bundle.json","state":"https://pith.science/pith/BXZG456GWK54IWS564QMGYDHCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXZG456GWK54IWS564QMGYDHCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BXZG456GWK54IWS564QMGYDHCU","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":"ecc33bf6e166d2e4f3a46a682e2dcddc6a5f3357320c8936030863659c195f53","cross_cats_sorted":["math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-26T19:44:45Z","title_canon_sha256":"f90c15f3b0c3af1cf4118a7b328ad7996a5d9a3e9d44e58c01e8b2c71fe55cd4"},"schema_version":"1.0","source":{"id":"1205.5913","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.5913","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"1205.5913v2","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5913","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"BXZG456GWK54","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BXZG456GWK54IWS5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BXZG456G","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:0af1c5b824c22378be10096fbd3dd7763a5548465d7c42e3090e71fd08a80c7a","target":"graph","created_at":"2026-05-18T03:12:20Z","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":"Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be computed from the spectrum) equals the average excess (the mean of the numbers of vertices at extremal distance from every vertex). The aim of this paper is to derive new characterizations of regularity and distance-regularity for the more restricted family of bipartite graphs. In this case, some characterizations of (bi)regular bipartite graphs are given in terms ","authors_text":"A. Abiad, C. Dalf\\`o, M.A. Fiol","cross_cats":["math.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-26T19:44:45Z","title":"Algebraic characterizations of regularity properties in bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5913","kind":"arxiv","version":2},"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:932739383688ab058bbb3df3b7a7e6b76d690e3cb6e5e293a68e2cc9b4065d80","target":"record","created_at":"2026-05-18T03:12:20Z","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":"ecc33bf6e166d2e4f3a46a682e2dcddc6a5f3357320c8936030863659c195f53","cross_cats_sorted":["math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-26T19:44:45Z","title_canon_sha256":"f90c15f3b0c3af1cf4118a7b328ad7996a5d9a3e9d44e58c01e8b2c71fe55cd4"},"schema_version":"1.0","source":{"id":"1205.5913","kind":"arxiv","version":2}},"canonical_sha256":"0df26e77c6b2bbc45a5df720c36067153027b0da630595f77131ec340e9a33a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0df26e77c6b2bbc45a5df720c36067153027b0da630595f77131ec340e9a33a3","first_computed_at":"2026-05-18T03:12:20.210040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:20.210040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xs06lEwW+ylEe78n3TzKUEVngZDmjl1cGozbziy4WNrRBIpmDbyMVpQGb5cp3MfJDy/Mq94zL9SyJ+T17b2nDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:20.210864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.5913","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:932739383688ab058bbb3df3b7a7e6b76d690e3cb6e5e293a68e2cc9b4065d80","sha256:0af1c5b824c22378be10096fbd3dd7763a5548465d7c42e3090e71fd08a80c7a"],"state_sha256":"55aead22bf6f568ce67159737ee5219650dece32ba373e3b51b7a48f8e23e9c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZBR00/iPvYwlOy6QPjecIKxO+7MZ1HHjm6D9PFP1IrG5Z4MSraozHavIgHWeDLfyLzryTXXQ6OHTqIDGeX9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:18:32.693271Z","bundle_sha256":"e3352542fad2164b11b90c3277f435ec49be93a817eba3e59f96aca1ca05df6d"}}