{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BPK5AICCADZQJSM2OF2KGRBNJQ","short_pith_number":"pith:BPK5AICC","canonical_record":{"source":{"id":"1204.1444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-06T09:55:33Z","cross_cats_sorted":[],"title_canon_sha256":"19baebc63357e43d1c90f479410b753ef71048f047a344fb3999cd7539b02fd7","abstract_canon_sha256":"2480a6b16088fc03c6a3a778df6ade17bbb90160dc21b48af673789702981cde"},"schema_version":"1.0"},"canonical_sha256":"0bd5d0204200f304c99a7174a3442d4c12b7e80d99f38e49f56c200db124ea02","source":{"kind":"arxiv","id":"1204.1444","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1444","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1444v2","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1444","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"BPK5AICCADZQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BPK5AICCADZQJSM2","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BPK5AICC","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BPK5AICCADZQJSM2OF2KGRBNJQ","target":"record","payload":{"canonical_record":{"source":{"id":"1204.1444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-06T09:55:33Z","cross_cats_sorted":[],"title_canon_sha256":"19baebc63357e43d1c90f479410b753ef71048f047a344fb3999cd7539b02fd7","abstract_canon_sha256":"2480a6b16088fc03c6a3a778df6ade17bbb90160dc21b48af673789702981cde"},"schema_version":"1.0"},"canonical_sha256":"0bd5d0204200f304c99a7174a3442d4c12b7e80d99f38e49f56c200db124ea02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:52.453876Z","signature_b64":"2/14VHddXFl/GdKUT3FpWOSqH32Y1I8P77PCjjl4oyQ++YGENZZvZd1ZFPsTDFG/lYOFTYX5xUfeUFpTKgUcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bd5d0204200f304c99a7174a3442d4c12b7e80d99f38e49f56c200db124ea02","last_reissued_at":"2026-05-18T02:49:52.453381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:52.453381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.1444","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-18T02:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8lo6vwdyoB7OKdP7nXqYRCb3xxdXRBQ8o0L+kNc3wXF9ZGfGcuPqU6fCxV5g6q4czLgSvhJeXqLBmMRNv30Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:08:15.495933Z"},"content_sha256":"dcdbc75046f458c32eecdc2b0222aca9af8ad03f5705d6df90271b5a774ecb87","schema_version":"1.0","event_id":"sha256:dcdbc75046f458c32eecdc2b0222aca9af8ad03f5705d6df90271b5a774ecb87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BPK5AICCADZQJSM2OF2KGRBNJQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the minimum rank of a loop directed tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jean-Charles Delvenne, Maguy Trefois","submitted_at":"2012-04-06T09:55:33Z","abstract_excerpt":"The minimum rank of a graph is the minimum possible rank of a real matrix whose zero-nonzero pattern is described by the graph. The current algorithms can compute efficiently the minimum rank of undirected trees. This paper provides an algorithm to compute in polynomial time the minimum rank of directed trees allowing loops."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1444","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-18T02:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8FCeIDFyJkEfxNZr7S93JEeGphZLUjUw0JcQ5UfM//D4B53hw+mlZAtRucc/GOUhsZAOL/4rfYGwtDyI6s/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:08:15.496682Z"},"content_sha256":"a1cfe34d32a871fa1f348310f7823480be65ea39a553e1ec4a16b656aad02ce5","schema_version":"1.0","event_id":"sha256:a1cfe34d32a871fa1f348310f7823480be65ea39a553e1ec4a16b656aad02ce5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPK5AICCADZQJSM2OF2KGRBNJQ/bundle.json","state_url":"https://pith.science/pith/BPK5AICCADZQJSM2OF2KGRBNJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPK5AICCADZQJSM2OF2KGRBNJQ/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-10T13:08:15Z","links":{"resolver":"https://pith.science/pith/BPK5AICCADZQJSM2OF2KGRBNJQ","bundle":"https://pith.science/pith/BPK5AICCADZQJSM2OF2KGRBNJQ/bundle.json","state":"https://pith.science/pith/BPK5AICCADZQJSM2OF2KGRBNJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPK5AICCADZQJSM2OF2KGRBNJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BPK5AICCADZQJSM2OF2KGRBNJQ","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":"2480a6b16088fc03c6a3a778df6ade17bbb90160dc21b48af673789702981cde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-06T09:55:33Z","title_canon_sha256":"19baebc63357e43d1c90f479410b753ef71048f047a344fb3999cd7539b02fd7"},"schema_version":"1.0","source":{"id":"1204.1444","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1444","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1444v2","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1444","created_at":"2026-05-18T02:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"BPK5AICCADZQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BPK5AICCADZQJSM2","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BPK5AICC","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:a1cfe34d32a871fa1f348310f7823480be65ea39a553e1ec4a16b656aad02ce5","target":"graph","created_at":"2026-05-18T02:49:52Z","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 rank of a graph is the minimum possible rank of a real matrix whose zero-nonzero pattern is described by the graph. The current algorithms can compute efficiently the minimum rank of undirected trees. This paper provides an algorithm to compute in polynomial time the minimum rank of directed trees allowing loops.","authors_text":"Jean-Charles Delvenne, Maguy Trefois","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-06T09:55:33Z","title":"Computing the minimum rank of a loop directed tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1444","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:dcdbc75046f458c32eecdc2b0222aca9af8ad03f5705d6df90271b5a774ecb87","target":"record","created_at":"2026-05-18T02:49:52Z","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":"2480a6b16088fc03c6a3a778df6ade17bbb90160dc21b48af673789702981cde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-06T09:55:33Z","title_canon_sha256":"19baebc63357e43d1c90f479410b753ef71048f047a344fb3999cd7539b02fd7"},"schema_version":"1.0","source":{"id":"1204.1444","kind":"arxiv","version":2}},"canonical_sha256":"0bd5d0204200f304c99a7174a3442d4c12b7e80d99f38e49f56c200db124ea02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bd5d0204200f304c99a7174a3442d4c12b7e80d99f38e49f56c200db124ea02","first_computed_at":"2026-05-18T02:49:52.453381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:52.453381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2/14VHddXFl/GdKUT3FpWOSqH32Y1I8P77PCjjl4oyQ++YGENZZvZd1ZFPsTDFG/lYOFTYX5xUfeUFpTKgUcAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:52.453876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1444","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcdbc75046f458c32eecdc2b0222aca9af8ad03f5705d6df90271b5a774ecb87","sha256:a1cfe34d32a871fa1f348310f7823480be65ea39a553e1ec4a16b656aad02ce5"],"state_sha256":"7d19ade872b950ce059e2ef0a41d0ff8c8a7856e49cb605018f4939664152c2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GlwUg4XuQjDOwNQkK7PEyTXLa9DKe0PwzZy/NwiLC7GtQk15eFp6D2hgLNlHIb0812AKk24c5CG+tqcaGw7kDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:08:15.501260Z","bundle_sha256":"562d806e05725091a37997ac601769687b6d864e9fddacd1b02ced34c6c8f3cb"}}