{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XHDSCPYYGFWLRET5ADEZETKYRQ","short_pith_number":"pith:XHDSCPYY","canonical_record":{"source":{"id":"1807.04208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-11T15:51:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d7692f61d59b5b7467e907a607d825cce432eccd36cca32e0e784c42b57abd1a","abstract_canon_sha256":"b7034f93c7dbdf268b59c7eb5ee8d78edd13e77655f9b851361927813781d348"},"schema_version":"1.0"},"canonical_sha256":"b9c7213f18316cb8927d00c9924d588c129f80ef713b0bc6fecf56101d08b2a9","source":{"kind":"arxiv","id":"1807.04208","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04208","created_at":"2026-05-18T00:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04208v2","created_at":"2026-05-18T00:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04208","created_at":"2026-05-18T00:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"XHDSCPYYGFWL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XHDSCPYYGFWLRET5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XHDSCPYY","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XHDSCPYYGFWLRET5ADEZETKYRQ","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-11T15:51:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d7692f61d59b5b7467e907a607d825cce432eccd36cca32e0e784c42b57abd1a","abstract_canon_sha256":"b7034f93c7dbdf268b59c7eb5ee8d78edd13e77655f9b851361927813781d348"},"schema_version":"1.0"},"canonical_sha256":"b9c7213f18316cb8927d00c9924d588c129f80ef713b0bc6fecf56101d08b2a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:46.235833Z","signature_b64":"mnzq27WNFsFjVqR4tsrI76duSu3PwySiTJMPeDMJOQm/YUyjxOBsKb+IMm7hPkjQ63cm2Dg1987c8WvqFRR1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9c7213f18316cb8927d00c9924d588c129f80ef713b0bc6fecf56101d08b2a9","last_reissued_at":"2026-05-18T00:03:46.235140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:46.235140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04208","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-18T00:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAyMkXJ7ErDTyHhRborR+Hc8ysbpJojsD+xM5n0zzOdJC041bMB+C7gYaMCPHVrd2+Y/QXc70Wh3kue4W5djCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:39:05.682636Z"},"content_sha256":"80db6c14ad89670fa5543ec7cdbc6a97ea9708357b03aad4ef111e9a08ea5b90","schema_version":"1.0","event_id":"sha256:80db6c14ad89670fa5543ec7cdbc6a97ea9708357b03aad4ef111e9a08ea5b90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XHDSCPYYGFWLRET5ADEZETKYRQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank of weighted digraphs with blocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Abraham Berman, Naomi Shaked-Monderer, Ranveer Singh, Swarup Kumar Panda","submitted_at":"2018-07-11T15:51:42Z","abstract_excerpt":"Let $G$ be a digraph and $r(G)$ be its rank. Many interesting results on the rank of an undirected graph appear in the literature, but not much information about the rank of a digraph is available. In this article, we study the rank of a digraph using the ranks of its blocks. In particular, we define classes of digraphs, namely $r_2$-digraph, and $r_0$-digraph, for which the rank can be exactly determined in terms of the ranks of subdigraphs of the blocks. Furthermore, the rank of directed trees, simple biblock graphs, and some simple block graphs are studied."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04208","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-18T00:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q71Kh8B9UDDlvoUyMC3eTiM1gvlz8ffqoIAY8kFmbUl9M4VmphAreYYBzgTFxbxIXc8iIYFIKs12qQmaFjYFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:39:05.682985Z"},"content_sha256":"ce68bb7cfed007862a6d4c91263cccd577b28d1a12383e54ee65d5935d9efc03","schema_version":"1.0","event_id":"sha256:ce68bb7cfed007862a6d4c91263cccd577b28d1a12383e54ee65d5935d9efc03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHDSCPYYGFWLRET5ADEZETKYRQ/bundle.json","state_url":"https://pith.science/pith/XHDSCPYYGFWLRET5ADEZETKYRQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHDSCPYYGFWLRET5ADEZETKYRQ/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-23T13:39:05Z","links":{"resolver":"https://pith.science/pith/XHDSCPYYGFWLRET5ADEZETKYRQ","bundle":"https://pith.science/pith/XHDSCPYYGFWLRET5ADEZETKYRQ/bundle.json","state":"https://pith.science/pith/XHDSCPYYGFWLRET5ADEZETKYRQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHDSCPYYGFWLRET5ADEZETKYRQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XHDSCPYYGFWLRET5ADEZETKYRQ","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":"b7034f93c7dbdf268b59c7eb5ee8d78edd13e77655f9b851361927813781d348","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-11T15:51:42Z","title_canon_sha256":"d7692f61d59b5b7467e907a607d825cce432eccd36cca32e0e784c42b57abd1a"},"schema_version":"1.0","source":{"id":"1807.04208","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04208","created_at":"2026-05-18T00:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04208v2","created_at":"2026-05-18T00:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04208","created_at":"2026-05-18T00:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"XHDSCPYYGFWL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XHDSCPYYGFWLRET5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XHDSCPYY","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:ce68bb7cfed007862a6d4c91263cccd577b28d1a12383e54ee65d5935d9efc03","target":"graph","created_at":"2026-05-18T00:03:46Z","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":"Let $G$ be a digraph and $r(G)$ be its rank. Many interesting results on the rank of an undirected graph appear in the literature, but not much information about the rank of a digraph is available. In this article, we study the rank of a digraph using the ranks of its blocks. In particular, we define classes of digraphs, namely $r_2$-digraph, and $r_0$-digraph, for which the rank can be exactly determined in terms of the ranks of subdigraphs of the blocks. Furthermore, the rank of directed trees, simple biblock graphs, and some simple block graphs are studied.","authors_text":"Abraham Berman, Naomi Shaked-Monderer, Ranveer Singh, Swarup Kumar Panda","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-11T15:51:42Z","title":"Rank of weighted digraphs with blocks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04208","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:80db6c14ad89670fa5543ec7cdbc6a97ea9708357b03aad4ef111e9a08ea5b90","target":"record","created_at":"2026-05-18T00:03:46Z","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":"b7034f93c7dbdf268b59c7eb5ee8d78edd13e77655f9b851361927813781d348","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-11T15:51:42Z","title_canon_sha256":"d7692f61d59b5b7467e907a607d825cce432eccd36cca32e0e784c42b57abd1a"},"schema_version":"1.0","source":{"id":"1807.04208","kind":"arxiv","version":2}},"canonical_sha256":"b9c7213f18316cb8927d00c9924d588c129f80ef713b0bc6fecf56101d08b2a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9c7213f18316cb8927d00c9924d588c129f80ef713b0bc6fecf56101d08b2a9","first_computed_at":"2026-05-18T00:03:46.235140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:46.235140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mnzq27WNFsFjVqR4tsrI76duSu3PwySiTJMPeDMJOQm/YUyjxOBsKb+IMm7hPkjQ63cm2Dg1987c8WvqFRR1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:46.235833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04208","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80db6c14ad89670fa5543ec7cdbc6a97ea9708357b03aad4ef111e9a08ea5b90","sha256:ce68bb7cfed007862a6d4c91263cccd577b28d1a12383e54ee65d5935d9efc03"],"state_sha256":"ed62d5746be5c11b9c0a552774110f526caf27923a05353e1f0b486ea4531be3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KP9Okfg/Y+ySlXSqrbxJSzgVB/AH+M82ugMjoRoCF+xLEZM2b5kElEk6BpTb6LfkwzkxbsIZaZjVEjiSNFXQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T13:39:05.684928Z","bundle_sha256":"996736017c8902bdb35c4a2f9042bbeb08e45e2963124b6c2077a7d0a6c10410"}}