{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TV4L3OTS23C6VUMV3CVRHJ7PKJ","short_pith_number":"pith:TV4L3OTS","canonical_record":{"source":{"id":"1805.09004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-23T08:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"192cef4e00bf64096503692028ccc039c9715e54b0ab2eb48300a2191de1da76","abstract_canon_sha256":"de3e57718671781a7501a0728194356046f2c6d45a50df8b75663e3345c6fdaa"},"schema_version":"1.0"},"canonical_sha256":"9d78bdba72d6c5ead195d8ab13a7ef52472654a2e22401789491f2e96ef01c56","source":{"kind":"arxiv","id":"1805.09004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09004","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09004v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09004","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"TV4L3OTS23C6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TV4L3OTS23C6VUMV","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TV4L3OTS","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TV4L3OTS23C6VUMV3CVRHJ7PKJ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-23T08:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"192cef4e00bf64096503692028ccc039c9715e54b0ab2eb48300a2191de1da76","abstract_canon_sha256":"de3e57718671781a7501a0728194356046f2c6d45a50df8b75663e3345c6fdaa"},"schema_version":"1.0"},"canonical_sha256":"9d78bdba72d6c5ead195d8ab13a7ef52472654a2e22401789491f2e96ef01c56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:08.821233Z","signature_b64":"OWGt+nfVO6p7oGzfkhoonFol9rjgVjsJTk5dSGm86MpsdNepcIh6gfeuYomZHAOQkt2ZL4JG4HpIS2z6y8/3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d78bdba72d6c5ead195d8ab13a7ef52472654a2e22401789491f2e96ef01c56","last_reissued_at":"2026-05-18T00:15:08.820854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:08.820854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09004","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-18T00:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDrhSqE/dI606J56jXLCNjFw+wE1ycQxGyJEezQfnbMlHbW7IkWduvTaFUpnaeEzqDWZD1iZ+BmB3Kgv/O4MCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:29:29.063789Z"},"content_sha256":"118166eb2ebf949d24bcdd3315bea75e7800e6b5c13de66a4a6920cc2caa6098","schema_version":"1.0","event_id":"sha256:118166eb2ebf949d24bcdd3315bea75e7800e6b5c13de66a4a6920cc2caa6098"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TV4L3OTS23C6VUMV3CVRHJ7PKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum number of non-zero-entries in a $7\\times 7$ stable matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chi-Kwong Li, Christopher Hambric, Diane Christine Pelejo, Junping Shi","submitted_at":"2018-05-23T08:14:05Z","abstract_excerpt":"We prove that if a $7\\times 7$ matrix is potentially stable, then it has at least 11 non-zero entries. The results for $n\\times n$ matrix with $n$ up to 6 are known previously. We prove the result by making a list of possible associated digraphs with at most 10 edges, and then use algebraic conditions to show all of these digraphs or matrices cannot be potentially stable. In relation to this, we also determine the minimum number of edges in a strongly connected digraph depending on its circumference."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09004","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-18T00:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ow6Ds1iz/yO6dh0LkHleNa4IjidicaC33TXWLnBe0w9sqQxybkOCJK9/BFxyqOkYcfCWB8/NBwjyEQ8G/YGsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:29:29.064146Z"},"content_sha256":"2c382d1bf1c4f3cb7f92264d5397e7f681858b8349d95b93566426cb6fd78c3f","schema_version":"1.0","event_id":"sha256:2c382d1bf1c4f3cb7f92264d5397e7f681858b8349d95b93566426cb6fd78c3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TV4L3OTS23C6VUMV3CVRHJ7PKJ/bundle.json","state_url":"https://pith.science/pith/TV4L3OTS23C6VUMV3CVRHJ7PKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TV4L3OTS23C6VUMV3CVRHJ7PKJ/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-07-02T06:29:29Z","links":{"resolver":"https://pith.science/pith/TV4L3OTS23C6VUMV3CVRHJ7PKJ","bundle":"https://pith.science/pith/TV4L3OTS23C6VUMV3CVRHJ7PKJ/bundle.json","state":"https://pith.science/pith/TV4L3OTS23C6VUMV3CVRHJ7PKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TV4L3OTS23C6VUMV3CVRHJ7PKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TV4L3OTS23C6VUMV3CVRHJ7PKJ","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":"de3e57718671781a7501a0728194356046f2c6d45a50df8b75663e3345c6fdaa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-23T08:14:05Z","title_canon_sha256":"192cef4e00bf64096503692028ccc039c9715e54b0ab2eb48300a2191de1da76"},"schema_version":"1.0","source":{"id":"1805.09004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09004","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09004v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09004","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"TV4L3OTS23C6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TV4L3OTS23C6VUMV","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TV4L3OTS","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:2c382d1bf1c4f3cb7f92264d5397e7f681858b8349d95b93566426cb6fd78c3f","target":"graph","created_at":"2026-05-18T00:15:08Z","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":"We prove that if a $7\\times 7$ matrix is potentially stable, then it has at least 11 non-zero entries. The results for $n\\times n$ matrix with $n$ up to 6 are known previously. We prove the result by making a list of possible associated digraphs with at most 10 edges, and then use algebraic conditions to show all of these digraphs or matrices cannot be potentially stable. In relation to this, we also determine the minimum number of edges in a strongly connected digraph depending on its circumference.","authors_text":"Chi-Kwong Li, Christopher Hambric, Diane Christine Pelejo, Junping Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-23T08:14:05Z","title":"Minimum number of non-zero-entries in a $7\\times 7$ stable matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09004","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:118166eb2ebf949d24bcdd3315bea75e7800e6b5c13de66a4a6920cc2caa6098","target":"record","created_at":"2026-05-18T00:15:08Z","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":"de3e57718671781a7501a0728194356046f2c6d45a50df8b75663e3345c6fdaa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-23T08:14:05Z","title_canon_sha256":"192cef4e00bf64096503692028ccc039c9715e54b0ab2eb48300a2191de1da76"},"schema_version":"1.0","source":{"id":"1805.09004","kind":"arxiv","version":1}},"canonical_sha256":"9d78bdba72d6c5ead195d8ab13a7ef52472654a2e22401789491f2e96ef01c56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d78bdba72d6c5ead195d8ab13a7ef52472654a2e22401789491f2e96ef01c56","first_computed_at":"2026-05-18T00:15:08.820854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:08.820854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OWGt+nfVO6p7oGzfkhoonFol9rjgVjsJTk5dSGm86MpsdNepcIh6gfeuYomZHAOQkt2ZL4JG4HpIS2z6y8/3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:08.821233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:118166eb2ebf949d24bcdd3315bea75e7800e6b5c13de66a4a6920cc2caa6098","sha256:2c382d1bf1c4f3cb7f92264d5397e7f681858b8349d95b93566426cb6fd78c3f"],"state_sha256":"9dd7213edbe881e8101ff8527f52c2aaae380347b167331deec3f90487c082d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgdjIDqeOxn0UjwBLv8Bq3GLVUi+GHlYfsgyRoSLEzJumPlaDd0tQy/evXn8CTz3Z3ohYR5YCMXiSubHZndjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T06:29:29.066186Z","bundle_sha256":"e96387f7b3b7df23a694108ab04022efd692fc1d53c2f07ee9090961beb9729a"}}