{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XOC7X64LLEM52DB6EOTPFZIMRT","short_pith_number":"pith:XOC7X64L","canonical_record":{"source":{"id":"1107.2170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-12T00:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"e290fbac435d11b6b946769b7924ba9715026142681e154e67b00bf988bf3a35","abstract_canon_sha256":"36db838f40fd67f20d249c112567227213f32732b48be1c71a2a62273db59aa1"},"schema_version":"1.0"},"canonical_sha256":"bb85fbfb8b5919dd0c3e23a6f2e50c8cfbc5883cf4cacfa7cc5dc260f85e2c85","source":{"kind":"arxiv","id":"1107.2170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2170","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2170v1","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2170","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"XOC7X64LLEM5","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XOC7X64LLEM52DB6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XOC7X64L","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XOC7X64LLEM52DB6EOTPFZIMRT","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-12T00:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"e290fbac435d11b6b946769b7924ba9715026142681e154e67b00bf988bf3a35","abstract_canon_sha256":"36db838f40fd67f20d249c112567227213f32732b48be1c71a2a62273db59aa1"},"schema_version":"1.0"},"canonical_sha256":"bb85fbfb8b5919dd0c3e23a6f2e50c8cfbc5883cf4cacfa7cc5dc260f85e2c85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:25.119511Z","signature_b64":"Pz6q58pSf3IL7JGBWSGn3sBP+fwuzZxW5YMASo2X0nU3WwRYAgO0CqEbu8wGA5VGddnlfQeqYlcCMim1aUjFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb85fbfb8b5919dd0c3e23a6f2e50c8cfbc5883cf4cacfa7cc5dc260f85e2c85","last_reissued_at":"2026-05-18T04:18:25.118859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:25.118859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2170","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-18T04:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ay5jHkadEDJWjO6IZn79HSDHbXmLpJcqp9+L7Aj/gmDl/3xYpQIVZ2juc1cnUhYvBBsF9PiDP5G03b3LNxQ3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:10:35.879153Z"},"content_sha256":"72a0cbebcccac4966f919aea1ed7a5bbd631658043b613bfeaf5737523fbdba1","schema_version":"1.0","event_id":"sha256:72a0cbebcccac4966f919aea1ed7a5bbd631658043b613bfeaf5737523fbdba1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XOC7X64LLEM52DB6EOTPFZIMRT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Acyclic and unicyclic graphs whose minimum skew rank is equal to the minimum skew rank of a diametrical path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luz M. DeAlba","submitted_at":"2011-07-12T00:24:10Z","abstract_excerpt":"The minimum skew rank of a simple graph G over the field of real numbers, is the smallest possible rank among all real skew-symmetric matrices whose (i,j)-entry (for i not equal to j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. In this paper we give an algorithm for computing the minimum skew rank of a connected unicyclic graph, and classify all connected acyclic and connected unicyclic graphs G, for which the minimum skew rank of G is equal to the minimum skew rank of P, where P is a diametrical path of G."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2170","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-18T04:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4taa324gVC/We3EjPkZoOhN64q9803+o+4o0q0sMkSKx+MLBRk4BsG3xfQFZ1ust5wpbpC31yQVEt9EWJj2OAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:10:35.879506Z"},"content_sha256":"bf2b5df5247805d3de3da3d445afc50a159f97c4fd36689f5fb7af6f75a9519d","schema_version":"1.0","event_id":"sha256:bf2b5df5247805d3de3da3d445afc50a159f97c4fd36689f5fb7af6f75a9519d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XOC7X64LLEM52DB6EOTPFZIMRT/bundle.json","state_url":"https://pith.science/pith/XOC7X64LLEM52DB6EOTPFZIMRT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XOC7X64LLEM52DB6EOTPFZIMRT/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-24T23:10:35Z","links":{"resolver":"https://pith.science/pith/XOC7X64LLEM52DB6EOTPFZIMRT","bundle":"https://pith.science/pith/XOC7X64LLEM52DB6EOTPFZIMRT/bundle.json","state":"https://pith.science/pith/XOC7X64LLEM52DB6EOTPFZIMRT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XOC7X64LLEM52DB6EOTPFZIMRT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XOC7X64LLEM52DB6EOTPFZIMRT","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":"36db838f40fd67f20d249c112567227213f32732b48be1c71a2a62273db59aa1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-12T00:24:10Z","title_canon_sha256":"e290fbac435d11b6b946769b7924ba9715026142681e154e67b00bf988bf3a35"},"schema_version":"1.0","source":{"id":"1107.2170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2170","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2170v1","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2170","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"XOC7X64LLEM5","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XOC7X64LLEM52DB6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XOC7X64L","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:bf2b5df5247805d3de3da3d445afc50a159f97c4fd36689f5fb7af6f75a9519d","target":"graph","created_at":"2026-05-18T04:18:25Z","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":"The minimum skew rank of a simple graph G over the field of real numbers, is the smallest possible rank among all real skew-symmetric matrices whose (i,j)-entry (for i not equal to j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. In this paper we give an algorithm for computing the minimum skew rank of a connected unicyclic graph, and classify all connected acyclic and connected unicyclic graphs G, for which the minimum skew rank of G is equal to the minimum skew rank of P, where P is a diametrical path of G.","authors_text":"Luz M. DeAlba","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-12T00:24:10Z","title":"Acyclic and unicyclic graphs whose minimum skew rank is equal to the minimum skew rank of a diametrical path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2170","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:72a0cbebcccac4966f919aea1ed7a5bbd631658043b613bfeaf5737523fbdba1","target":"record","created_at":"2026-05-18T04:18:25Z","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":"36db838f40fd67f20d249c112567227213f32732b48be1c71a2a62273db59aa1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-12T00:24:10Z","title_canon_sha256":"e290fbac435d11b6b946769b7924ba9715026142681e154e67b00bf988bf3a35"},"schema_version":"1.0","source":{"id":"1107.2170","kind":"arxiv","version":1}},"canonical_sha256":"bb85fbfb8b5919dd0c3e23a6f2e50c8cfbc5883cf4cacfa7cc5dc260f85e2c85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb85fbfb8b5919dd0c3e23a6f2e50c8cfbc5883cf4cacfa7cc5dc260f85e2c85","first_computed_at":"2026-05-18T04:18:25.118859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:25.118859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pz6q58pSf3IL7JGBWSGn3sBP+fwuzZxW5YMASo2X0nU3WwRYAgO0CqEbu8wGA5VGddnlfQeqYlcCMim1aUjFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:25.119511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72a0cbebcccac4966f919aea1ed7a5bbd631658043b613bfeaf5737523fbdba1","sha256:bf2b5df5247805d3de3da3d445afc50a159f97c4fd36689f5fb7af6f75a9519d"],"state_sha256":"b406c2efb7b0cc481db387e83adaaf3e82b0bd75c9b9efbeddef845da1fc7eb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e2tbnA2d0O+JIh9bwcL9wDtgUjTWVN5gXeCOq3zgi3xgD0kQNKk1Jz3OEJTaqBx8DDR/nzHAo9xOowk7ju9LAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:10:35.881486Z","bundle_sha256":"b1507045e23addf12819b9e9393b8133fe83563885731d0e6c6296ce0f582cce"}}