{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2UOU7PZ7X3KZ2VQYAOWPJYFZMO","short_pith_number":"pith:2UOU7PZ7","canonical_record":{"source":{"id":"1404.7230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-29T04:09:12Z","cross_cats_sorted":[],"title_canon_sha256":"7711262100c0d999ddd220b2aa4a07551954b877838a9816ce679bdf6871b9e9","abstract_canon_sha256":"941f820a1fe6de4b2a1fcf2be5cd1a033e2a50deadc451e899f3f929ff6e71d0"},"schema_version":"1.0"},"canonical_sha256":"d51d4fbf3fbed59d561803acf4e0b9639673b375e955892ed6ee95b83b7a8cc7","source":{"kind":"arxiv","id":"1404.7230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7230","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7230v1","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7230","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"2UOU7PZ7X3KZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2UOU7PZ7X3KZ2VQY","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2UOU7PZ7","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2UOU7PZ7X3KZ2VQYAOWPJYFZMO","target":"record","payload":{"canonical_record":{"source":{"id":"1404.7230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-29T04:09:12Z","cross_cats_sorted":[],"title_canon_sha256":"7711262100c0d999ddd220b2aa4a07551954b877838a9816ce679bdf6871b9e9","abstract_canon_sha256":"941f820a1fe6de4b2a1fcf2be5cd1a033e2a50deadc451e899f3f929ff6e71d0"},"schema_version":"1.0"},"canonical_sha256":"d51d4fbf3fbed59d561803acf4e0b9639673b375e955892ed6ee95b83b7a8cc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:57.168473Z","signature_b64":"YVCCymK4j+Ha56Ww/VcDoqNjQ1/+HF9/jOOiEhKYqFWUQylJf3tN9Mz5DERs/ubK6883QG0SlczK5sqlfVI1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d51d4fbf3fbed59d561803acf4e0b9639673b375e955892ed6ee95b83b7a8cc7","last_reissued_at":"2026-05-18T02:52:57.167883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:57.167883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.7230","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:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UL1vuXa3oShyrF7t1/2YuO+AVpM7WKJLmOqvbBRNxtxi+1kafy3ab/gHRhiZyZ9Mnak0du+Pp24pGQAYphQtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:59:50.823701Z"},"content_sha256":"7ebc31063ed6664d2b6c363ecffb66ebebe29aaee72c7a01f5a9ab64c4ad2fe9","schema_version":"1.0","event_id":"sha256:7ebc31063ed6664d2b6c363ecffb66ebebe29aaee72c7a01f5a9ab64c4ad2fe9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2UOU7PZ7X3KZ2VQYAOWPJYFZMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The skew-rank of oriented graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guihai Yu, Xueliang Li","submitted_at":"2014-04-29T04:09:12Z","abstract_excerpt":"An oriented graph $G^\\sigma$ is a digraph without loops and multiple arcs, where $G$ is called the underlying graph of $G^\\sigma$. Let $S(G^\\sigma)$ denote the skew-adjacency matrix of $G^\\sigma$. The rank of the skew-adjacency matrix of $G^\\sigma$ is called the {\\it skew-rank} of $G^\\sigma$, denoted by $sr(G^\\sigma)$. The skew-adjacency matrix of an oriented graph is skew symmetric and the skew-rank is even. In this paper we consider the skew-rank of simple oriented graphs. Firstly we give some preliminary results about the skew-rank. Secondly we characterize the oriented graphs with skew-ran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7230","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:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7QmBE/pFwYd+AoDowMDXVkOv/oJdiC/kmIWplTYKk0PYfwHhcp3UMa52P0tD7YmEKzKieMhZ9v1/eOdJIInCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:59:50.824040Z"},"content_sha256":"ecd3a4a22e51b10a6c9a0ee1c2b69296298f573203d5afffaab922d224a23aa9","schema_version":"1.0","event_id":"sha256:ecd3a4a22e51b10a6c9a0ee1c2b69296298f573203d5afffaab922d224a23aa9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UOU7PZ7X3KZ2VQYAOWPJYFZMO/bundle.json","state_url":"https://pith.science/pith/2UOU7PZ7X3KZ2VQYAOWPJYFZMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UOU7PZ7X3KZ2VQYAOWPJYFZMO/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-01T16:59:50Z","links":{"resolver":"https://pith.science/pith/2UOU7PZ7X3KZ2VQYAOWPJYFZMO","bundle":"https://pith.science/pith/2UOU7PZ7X3KZ2VQYAOWPJYFZMO/bundle.json","state":"https://pith.science/pith/2UOU7PZ7X3KZ2VQYAOWPJYFZMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UOU7PZ7X3KZ2VQYAOWPJYFZMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2UOU7PZ7X3KZ2VQYAOWPJYFZMO","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":"941f820a1fe6de4b2a1fcf2be5cd1a033e2a50deadc451e899f3f929ff6e71d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-29T04:09:12Z","title_canon_sha256":"7711262100c0d999ddd220b2aa4a07551954b877838a9816ce679bdf6871b9e9"},"schema_version":"1.0","source":{"id":"1404.7230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7230","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7230v1","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7230","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"2UOU7PZ7X3KZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2UOU7PZ7X3KZ2VQY","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2UOU7PZ7","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:ecd3a4a22e51b10a6c9a0ee1c2b69296298f573203d5afffaab922d224a23aa9","target":"graph","created_at":"2026-05-18T02:52:57Z","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":"An oriented graph $G^\\sigma$ is a digraph without loops and multiple arcs, where $G$ is called the underlying graph of $G^\\sigma$. Let $S(G^\\sigma)$ denote the skew-adjacency matrix of $G^\\sigma$. The rank of the skew-adjacency matrix of $G^\\sigma$ is called the {\\it skew-rank} of $G^\\sigma$, denoted by $sr(G^\\sigma)$. The skew-adjacency matrix of an oriented graph is skew symmetric and the skew-rank is even. In this paper we consider the skew-rank of simple oriented graphs. Firstly we give some preliminary results about the skew-rank. Secondly we characterize the oriented graphs with skew-ran","authors_text":"Guihai Yu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-29T04:09:12Z","title":"The skew-rank of oriented graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7230","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:7ebc31063ed6664d2b6c363ecffb66ebebe29aaee72c7a01f5a9ab64c4ad2fe9","target":"record","created_at":"2026-05-18T02:52:57Z","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":"941f820a1fe6de4b2a1fcf2be5cd1a033e2a50deadc451e899f3f929ff6e71d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-29T04:09:12Z","title_canon_sha256":"7711262100c0d999ddd220b2aa4a07551954b877838a9816ce679bdf6871b9e9"},"schema_version":"1.0","source":{"id":"1404.7230","kind":"arxiv","version":1}},"canonical_sha256":"d51d4fbf3fbed59d561803acf4e0b9639673b375e955892ed6ee95b83b7a8cc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d51d4fbf3fbed59d561803acf4e0b9639673b375e955892ed6ee95b83b7a8cc7","first_computed_at":"2026-05-18T02:52:57.167883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:57.167883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YVCCymK4j+Ha56Ww/VcDoqNjQ1/+HF9/jOOiEhKYqFWUQylJf3tN9Mz5DERs/ubK6883QG0SlczK5sqlfVI1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:57.168473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.7230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ebc31063ed6664d2b6c363ecffb66ebebe29aaee72c7a01f5a9ab64c4ad2fe9","sha256:ecd3a4a22e51b10a6c9a0ee1c2b69296298f573203d5afffaab922d224a23aa9"],"state_sha256":"e7f14e3b48c9f2721fd1e6ed56375e1777a1c84e8b506ba348b1e2291da3360f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kllQwhn6/TiND/a9WdRwqW4rjcnpJLXTpprDeYoGKvXi6DIOTSIkRJEc15mmeo/kzm0yhPB8n0sXVQmEghvsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:59:50.826562Z","bundle_sha256":"c78837f6e6cb53277827af344efdc8b5c0e5665fd4803cc79f481f68a5a27509"}}