{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:V3TZ5G4WQJ6KEHI3OHBFO6LUPI","short_pith_number":"pith:V3TZ5G4W","canonical_record":{"source":{"id":"1905.13228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-31T01:09:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e31b831725394921d3082a691c167ea4ef2753a6772dbb76a98d1ad568959ded","abstract_canon_sha256":"ab164a2be3125d2825bc2751f9328c1362abb09d769a01568887a5f6d05e1621"},"schema_version":"1.0"},"canonical_sha256":"aee79e9b96827ca21d1b71c25779747a142666199045599f9c974476d3de27bc","source":{"kind":"arxiv","id":"1905.13228","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13228","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13228v1","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13228","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"V3TZ5G4WQJ6K","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V3TZ5G4WQJ6KEHI3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V3TZ5G4W","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:V3TZ5G4WQJ6KEHI3OHBFO6LUPI","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-31T01:09:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e31b831725394921d3082a691c167ea4ef2753a6772dbb76a98d1ad568959ded","abstract_canon_sha256":"ab164a2be3125d2825bc2751f9328c1362abb09d769a01568887a5f6d05e1621"},"schema_version":"1.0"},"canonical_sha256":"aee79e9b96827ca21d1b71c25779747a142666199045599f9c974476d3de27bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:37.246492Z","signature_b64":"957hpN6XuDL/ZxzTtg0GQq16PgW1flNHCMvIeYjOIlJPdbOHpxuv2I/8lbwWtLJDgf7Kx+ObmYr6tAM1iJszBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aee79e9b96827ca21d1b71c25779747a142666199045599f9c974476d3de27bc","last_reissued_at":"2026-05-17T23:44:37.246023Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:37.246023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13228","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-17T23:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBAoCMZr48ufPiAVAHglnWsRF9ZRdK/q7vv89MCsvjNqImhCkFERHZQeY7gOZc6pYtVE9/IBttDy73ZNkooHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:06:19.565356Z"},"content_sha256":"c386b88e97d9ca654d53d750de236836e91847766d5cdf5bcf52fdcc6a93340d","schema_version":"1.0","event_id":"sha256:c386b88e97d9ca654d53d750de236836e91847766d5cdf5bcf52fdcc6a93340d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:V3TZ5G4WQJ6KEHI3OHBFO6LUPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ali Dehghan, Amir H. Banihashemi","submitted_at":"2019-05-31T01:09:34Z","abstract_excerpt":"Finding the multiplicity of cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. Recently, Blake and Lin computed the number of shortest cycles ($g$-cycles, where $g$ is the girth of the graph) in a bi-regular bipartite graph, in terms of the degree sequences and the spectrum (eigenvalues of the adjacency matrix) of the graph [{\\em IEEE Trans. Inform. Theory 64(10):6526--6535, 2018}]. This result was subsequently extended in [{\\em IEEE Trans. Inform. Theory, accepted for publication, Dec. 2018"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13228","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-17T23:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7ksNB8ZX9WHCiqmxSOBx+tpDlxoiiFPdGJDZMhkLF75CEZTpKUXtY8JC1OJeagCzwe7oSr22s5xECstbfXhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:06:19.566037Z"},"content_sha256":"10f2558dc1e289dafe24dc593751f49eed982b538c0f9268f317a4ccdf203205","schema_version":"1.0","event_id":"sha256:10f2558dc1e289dafe24dc593751f49eed982b538c0f9268f317a4ccdf203205"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3TZ5G4WQJ6KEHI3OHBFO6LUPI/bundle.json","state_url":"https://pith.science/pith/V3TZ5G4WQJ6KEHI3OHBFO6LUPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3TZ5G4WQJ6KEHI3OHBFO6LUPI/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-06T06:06:19Z","links":{"resolver":"https://pith.science/pith/V3TZ5G4WQJ6KEHI3OHBFO6LUPI","bundle":"https://pith.science/pith/V3TZ5G4WQJ6KEHI3OHBFO6LUPI/bundle.json","state":"https://pith.science/pith/V3TZ5G4WQJ6KEHI3OHBFO6LUPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3TZ5G4WQJ6KEHI3OHBFO6LUPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:V3TZ5G4WQJ6KEHI3OHBFO6LUPI","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":"ab164a2be3125d2825bc2751f9328c1362abb09d769a01568887a5f6d05e1621","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-31T01:09:34Z","title_canon_sha256":"e31b831725394921d3082a691c167ea4ef2753a6772dbb76a98d1ad568959ded"},"schema_version":"1.0","source":{"id":"1905.13228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13228","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13228v1","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13228","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"V3TZ5G4WQJ6K","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V3TZ5G4WQJ6KEHI3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V3TZ5G4W","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:10f2558dc1e289dafe24dc593751f49eed982b538c0f9268f317a4ccdf203205","target":"graph","created_at":"2026-05-17T23:44:37Z","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":"Finding the multiplicity of cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. Recently, Blake and Lin computed the number of shortest cycles ($g$-cycles, where $g$ is the girth of the graph) in a bi-regular bipartite graph, in terms of the degree sequences and the spectrum (eigenvalues of the adjacency matrix) of the graph [{\\em IEEE Trans. Inform. Theory 64(10):6526--6535, 2018}]. This result was subsequently extended in [{\\em IEEE Trans. Inform. Theory, accepted for publication, Dec. 2018","authors_text":"Ali Dehghan, Amir H. Banihashemi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-31T01:09:34Z","title":"Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13228","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:c386b88e97d9ca654d53d750de236836e91847766d5cdf5bcf52fdcc6a93340d","target":"record","created_at":"2026-05-17T23:44:37Z","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":"ab164a2be3125d2825bc2751f9328c1362abb09d769a01568887a5f6d05e1621","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-31T01:09:34Z","title_canon_sha256":"e31b831725394921d3082a691c167ea4ef2753a6772dbb76a98d1ad568959ded"},"schema_version":"1.0","source":{"id":"1905.13228","kind":"arxiv","version":1}},"canonical_sha256":"aee79e9b96827ca21d1b71c25779747a142666199045599f9c974476d3de27bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aee79e9b96827ca21d1b71c25779747a142666199045599f9c974476d3de27bc","first_computed_at":"2026-05-17T23:44:37.246023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:37.246023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"957hpN6XuDL/ZxzTtg0GQq16PgW1flNHCMvIeYjOIlJPdbOHpxuv2I/8lbwWtLJDgf7Kx+ObmYr6tAM1iJszBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:37.246492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c386b88e97d9ca654d53d750de236836e91847766d5cdf5bcf52fdcc6a93340d","sha256:10f2558dc1e289dafe24dc593751f49eed982b538c0f9268f317a4ccdf203205"],"state_sha256":"9c6741fc411a64df3015b2c42e1a4d38c9b9b37a3a4640e92452fc4d55e13512"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UkHTJq5eNtVsRDIaH0PLjX7KmxTJJcdjW7q2hUdrM6bUsx2g4QLZIRIwFEl2NsiisTCcBQHP27j7u09SPymCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:06:19.570333Z","bundle_sha256":"111e01d23a5d61c18685e2231cbe298cedea6e89932635f2e004dfa2b4c08345"}}