{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2SDPDGVBPBNN6HAU7HY26WCOZQ","short_pith_number":"pith:2SDPDGVB","canonical_record":{"source":{"id":"1511.07920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T23:45:24Z","cross_cats_sorted":[],"title_canon_sha256":"32f33d39c0e68fa81e67fa2f67dae3c4f456f19ee52a5a85933a0eab40445a11","abstract_canon_sha256":"6801d707facc0ee37f01e335adadbd5969516f962c2a6fa0f9714b1f2b8d5d79"},"schema_version":"1.0"},"canonical_sha256":"d486f19aa1785adf1c14f9f1af584ecc2c630f9f902374d7e1ac2d9c250c32da","source":{"kind":"arxiv","id":"1511.07920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07920","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07920v1","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07920","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"2SDPDGVBPBNN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SDPDGVBPBNN6HAU","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SDPDGVB","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2SDPDGVBPBNN6HAU7HY26WCOZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T23:45:24Z","cross_cats_sorted":[],"title_canon_sha256":"32f33d39c0e68fa81e67fa2f67dae3c4f456f19ee52a5a85933a0eab40445a11","abstract_canon_sha256":"6801d707facc0ee37f01e335adadbd5969516f962c2a6fa0f9714b1f2b8d5d79"},"schema_version":"1.0"},"canonical_sha256":"d486f19aa1785adf1c14f9f1af584ecc2c630f9f902374d7e1ac2d9c250c32da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:02.232617Z","signature_b64":"+Rz4eAmpWqZyliIb7e1JapcyyFUFBCHBsRL6cPUhxEPRta2RbtKSTGTv6EHS53JaQo2Ri6Wucdc3qbNVTqwdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d486f19aa1785adf1c14f9f1af584ecc2c630f9f902374d7e1ac2d9c250c32da","last_reissued_at":"2026-05-18T01:26:02.231830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:02.231830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07920","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-18T01:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WqywYvZpsU3Ae2cgBBNOylNIp1HDFnjS6ZANGl//MfopvapRworDH/cM9MQKHrLEnJTKtgIOGwMYHCTdkgNTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:11.162141Z"},"content_sha256":"fb545f280bde2bd3a54aff7f9ff71ed3f411afa8d40cbb5829a6405b6378758f","schema_version":"1.0","event_id":"sha256:fb545f280bde2bd3a54aff7f9ff71ed3f411afa8d40cbb5829a6405b6378758f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2SDPDGVBPBNN6HAU7HY26WCOZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The minimum rank problem for circulants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis Deaett, Seth A. Meyer","submitted_at":"2015-11-24T23:45:24Z","abstract_excerpt":"The minimum rank problem is to determine for a graph $G$ the smallest rank of a Hermitian (or real symmetric) matrix whose off-diagonal zero-nonzero pattern is that of the adjacency matrix of $G$. Here $G$ is taken to be a circulant graph, and only circulant matrices are considered. The resulting graph parameter is termed the minimum circulant rank of the graph. This value is determined for every circulant graph in which a vertex neighborhood forms a consecutive set, and in this case is shown to coincide with the usual minimum rank. Under the additional restriction to positive semidefinite mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07920","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-18T01:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nw79h3vPu+pxteNDXzGZxeOKHsw3Ptvij6ynOmrTy2FMCDDMB7bkChJGoLBTIiwEm+0I1vlhg3bcOSq6lVqlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:11.162791Z"},"content_sha256":"f293ee588c0032b788eb2f24e4da613211594535b71024ae8db34116d3e1e58c","schema_version":"1.0","event_id":"sha256:f293ee588c0032b788eb2f24e4da613211594535b71024ae8db34116d3e1e58c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SDPDGVBPBNN6HAU7HY26WCOZQ/bundle.json","state_url":"https://pith.science/pith/2SDPDGVBPBNN6HAU7HY26WCOZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SDPDGVBPBNN6HAU7HY26WCOZQ/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-05-28T12:15:11Z","links":{"resolver":"https://pith.science/pith/2SDPDGVBPBNN6HAU7HY26WCOZQ","bundle":"https://pith.science/pith/2SDPDGVBPBNN6HAU7HY26WCOZQ/bundle.json","state":"https://pith.science/pith/2SDPDGVBPBNN6HAU7HY26WCOZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SDPDGVBPBNN6HAU7HY26WCOZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2SDPDGVBPBNN6HAU7HY26WCOZQ","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":"6801d707facc0ee37f01e335adadbd5969516f962c2a6fa0f9714b1f2b8d5d79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T23:45:24Z","title_canon_sha256":"32f33d39c0e68fa81e67fa2f67dae3c4f456f19ee52a5a85933a0eab40445a11"},"schema_version":"1.0","source":{"id":"1511.07920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07920","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07920v1","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07920","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"2SDPDGVBPBNN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SDPDGVBPBNN6HAU","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SDPDGVB","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:f293ee588c0032b788eb2f24e4da613211594535b71024ae8db34116d3e1e58c","target":"graph","created_at":"2026-05-18T01:26:02Z","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 problem is to determine for a graph $G$ the smallest rank of a Hermitian (or real symmetric) matrix whose off-diagonal zero-nonzero pattern is that of the adjacency matrix of $G$. Here $G$ is taken to be a circulant graph, and only circulant matrices are considered. The resulting graph parameter is termed the minimum circulant rank of the graph. This value is determined for every circulant graph in which a vertex neighborhood forms a consecutive set, and in this case is shown to coincide with the usual minimum rank. Under the additional restriction to positive semidefinite mat","authors_text":"Louis Deaett, Seth A. Meyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T23:45:24Z","title":"The minimum rank problem for circulants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07920","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:fb545f280bde2bd3a54aff7f9ff71ed3f411afa8d40cbb5829a6405b6378758f","target":"record","created_at":"2026-05-18T01:26:02Z","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":"6801d707facc0ee37f01e335adadbd5969516f962c2a6fa0f9714b1f2b8d5d79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T23:45:24Z","title_canon_sha256":"32f33d39c0e68fa81e67fa2f67dae3c4f456f19ee52a5a85933a0eab40445a11"},"schema_version":"1.0","source":{"id":"1511.07920","kind":"arxiv","version":1}},"canonical_sha256":"d486f19aa1785adf1c14f9f1af584ecc2c630f9f902374d7e1ac2d9c250c32da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d486f19aa1785adf1c14f9f1af584ecc2c630f9f902374d7e1ac2d9c250c32da","first_computed_at":"2026-05-18T01:26:02.231830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:02.231830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Rz4eAmpWqZyliIb7e1JapcyyFUFBCHBsRL6cPUhxEPRta2RbtKSTGTv6EHS53JaQo2Ri6Wucdc3qbNVTqwdBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:02.232617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb545f280bde2bd3a54aff7f9ff71ed3f411afa8d40cbb5829a6405b6378758f","sha256:f293ee588c0032b788eb2f24e4da613211594535b71024ae8db34116d3e1e58c"],"state_sha256":"8a3114b6726b22c26fa23ebaf9f7eed764db07105af1d892e24ca3d88eab2228"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJEYHqeCea2KsZ5CmRTEw8Xp4mS6zKguEH5O7ii40CXXsgHOZI5jlJPn80m0QnywoSP6ih3jOvaSqpIc+RItCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:15:11.165960Z","bundle_sha256":"fe2b9f9da5ebcd4876ee6c3cce309a30902c86c885ada075062ee5d98b3addda"}}