{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KQU2RXL35GUANAPHRRZ6R6B3UK","short_pith_number":"pith:KQU2RXL3","canonical_record":{"source":{"id":"1004.3966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-22T17:35:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a8fdc88c9093603522b595c45d76c69c4d05a421d9ab602d5bb2ba40336c349d","abstract_canon_sha256":"f7e343cd4e62dbc320fd222654db34c194ac9bf7c4dc75e3c1f7b9e32ef16a70"},"schema_version":"1.0"},"canonical_sha256":"5429a8dd7be9a80681e78c73e8f83ba2af73b337a8fe5a86cb64b9b4478dfc66","source":{"kind":"arxiv","id":"1004.3966","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3966","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3966v1","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3966","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"KQU2RXL35GUA","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KQU2RXL35GUANAPH","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KQU2RXL3","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KQU2RXL35GUANAPHRRZ6R6B3UK","target":"record","payload":{"canonical_record":{"source":{"id":"1004.3966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-22T17:35:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a8fdc88c9093603522b595c45d76c69c4d05a421d9ab602d5bb2ba40336c349d","abstract_canon_sha256":"f7e343cd4e62dbc320fd222654db34c194ac9bf7c4dc75e3c1f7b9e32ef16a70"},"schema_version":"1.0"},"canonical_sha256":"5429a8dd7be9a80681e78c73e8f83ba2af73b337a8fe5a86cb64b9b4478dfc66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:16.294375Z","signature_b64":"essz4LZZiTYRvE3QoIMcjkJ+yTuBnP1ECLjNWagnBy20pCHuMOAC3WKRBmE1JOdJxcJS4XqY2ThV127S/6yVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5429a8dd7be9a80681e78c73e8f83ba2af73b337a8fe5a86cb64b9b4478dfc66","last_reissued_at":"2026-05-18T02:24:16.293772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:16.293772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.3966","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:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6x8iQ5VnD0HB1aBv/6mAxQz7+Ekk3tC3xxKpkOLTJrKSZ24/EZX6iV9lIS0BoUB6Lbji/3kqowMM0Czmo7WCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:55:54.577162Z"},"content_sha256":"3e57a45b236b7c96483fe6b83a80d09a2e6abf3ded5cea13ff7043fc010c6ca9","schema_version":"1.0","event_id":"sha256:3e57a45b236b7c96483fe6b83a80d09a2e6abf3ded5cea13ff7043fc010c6ca9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KQU2RXL35GUANAPHRRZ6R6B3UK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Message-Passing Algorithm for Counting Short Cycles in a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir H. Banihashemi, Mehdi Karimi","submitted_at":"2010-04-22T17:35:28Z","abstract_excerpt":"A message-passing algorithm for counting short cycles in a graph is presented. For bipartite graphs, which are of particular interest in coding, the algorithm is capable of counting cycles of length g, g +2,..., 2g - 2, where g is the girth of the graph. For a general (non-bipartite) graph, cycles of length g; g + 1, ..., 2g - 1 can be counted. The algorithm is based on performing integer additions and subtractions in the nodes of the graph and passing extrinsic messages to adjacent nodes. The complexity of the proposed algorithm grows as $O(g|E|^2)$, where $|E|$ is the number of edges in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3966","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:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yyDHDdRze+ZPV49FFROwf5G7YN2tS88GYyR7xeqZPMBkdeUXZzvA4Ad562Pd4Y0ucGGQHYLRi3rRbCr4ltc1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:55:54.577524Z"},"content_sha256":"ec70a7045c85a4979633f24182c7322918e7e4fe44800d72d25bf9a5a378bd6f","schema_version":"1.0","event_id":"sha256:ec70a7045c85a4979633f24182c7322918e7e4fe44800d72d25bf9a5a378bd6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQU2RXL35GUANAPHRRZ6R6B3UK/bundle.json","state_url":"https://pith.science/pith/KQU2RXL35GUANAPHRRZ6R6B3UK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQU2RXL35GUANAPHRRZ6R6B3UK/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-20T05:55:54Z","links":{"resolver":"https://pith.science/pith/KQU2RXL35GUANAPHRRZ6R6B3UK","bundle":"https://pith.science/pith/KQU2RXL35GUANAPHRRZ6R6B3UK/bundle.json","state":"https://pith.science/pith/KQU2RXL35GUANAPHRRZ6R6B3UK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQU2RXL35GUANAPHRRZ6R6B3UK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KQU2RXL35GUANAPHRRZ6R6B3UK","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":"f7e343cd4e62dbc320fd222654db34c194ac9bf7c4dc75e3c1f7b9e32ef16a70","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-22T17:35:28Z","title_canon_sha256":"a8fdc88c9093603522b595c45d76c69c4d05a421d9ab602d5bb2ba40336c349d"},"schema_version":"1.0","source":{"id":"1004.3966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3966","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3966v1","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3966","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"KQU2RXL35GUA","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KQU2RXL35GUANAPH","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KQU2RXL3","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:ec70a7045c85a4979633f24182c7322918e7e4fe44800d72d25bf9a5a378bd6f","target":"graph","created_at":"2026-05-18T02:24:16Z","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":"A message-passing algorithm for counting short cycles in a graph is presented. For bipartite graphs, which are of particular interest in coding, the algorithm is capable of counting cycles of length g, g +2,..., 2g - 2, where g is the girth of the graph. For a general (non-bipartite) graph, cycles of length g; g + 1, ..., 2g - 1 can be counted. The algorithm is based on performing integer additions and subtractions in the nodes of the graph and passing extrinsic messages to adjacent nodes. The complexity of the proposed algorithm grows as $O(g|E|^2)$, where $|E|$ is the number of edges in the ","authors_text":"Amir H. Banihashemi, Mehdi Karimi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-22T17:35:28Z","title":"A Message-Passing Algorithm for Counting Short Cycles in a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3966","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:3e57a45b236b7c96483fe6b83a80d09a2e6abf3ded5cea13ff7043fc010c6ca9","target":"record","created_at":"2026-05-18T02:24:16Z","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":"f7e343cd4e62dbc320fd222654db34c194ac9bf7c4dc75e3c1f7b9e32ef16a70","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-22T17:35:28Z","title_canon_sha256":"a8fdc88c9093603522b595c45d76c69c4d05a421d9ab602d5bb2ba40336c349d"},"schema_version":"1.0","source":{"id":"1004.3966","kind":"arxiv","version":1}},"canonical_sha256":"5429a8dd7be9a80681e78c73e8f83ba2af73b337a8fe5a86cb64b9b4478dfc66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5429a8dd7be9a80681e78c73e8f83ba2af73b337a8fe5a86cb64b9b4478dfc66","first_computed_at":"2026-05-18T02:24:16.293772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:16.293772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"essz4LZZiTYRvE3QoIMcjkJ+yTuBnP1ECLjNWagnBy20pCHuMOAC3WKRBmE1JOdJxcJS4XqY2ThV127S/6yVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:16.294375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.3966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e57a45b236b7c96483fe6b83a80d09a2e6abf3ded5cea13ff7043fc010c6ca9","sha256:ec70a7045c85a4979633f24182c7322918e7e4fe44800d72d25bf9a5a378bd6f"],"state_sha256":"789c848214def5e4b584478668e3be7f0f6ea76515598ab7dd08e09f87131f9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gdl4QHhmNqEZnoEXiSS1xMldlkH+hJO5Hs53IG/qXvp4fm0NsKdIg3n+t5qOw4WzitpQhOhfGjgfLODr1L8ABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:55:54.579389Z","bundle_sha256":"62f6e7ccb23ef584164a5f136c92fd68e508825143545bfb64f6512c28ee57e5"}}