{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:LZNXSNTAL3XEMGEUYG5U2FOX27","short_pith_number":"pith:LZNXSNTA","canonical_record":{"source":{"id":"2111.12240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-24T03:09:03Z","cross_cats_sorted":[],"title_canon_sha256":"09c8794cefc03e7d27540e069eea33cc169995b64f2d014bd6650f31e5dca32c","abstract_canon_sha256":"86730db63884df1640a849f64ca60abe1d06135f2909b81d6899949e4c088f09"},"schema_version":"1.0"},"canonical_sha256":"5e5b7936605eee461894c1bb4d15d7d7cc3a74f6b6cb3b75f42b22d95d17b5d2","source":{"kind":"arxiv","id":"2111.12240","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.12240","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"2111.12240v1","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12240","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"LZNXSNTAL3XE","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_16","alias_value":"LZNXSNTAL3XEMGEU","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_8","alias_value":"LZNXSNTA","created_at":"2026-07-05T03:34:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:LZNXSNTAL3XEMGEUYG5U2FOX27","target":"record","payload":{"canonical_record":{"source":{"id":"2111.12240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-24T03:09:03Z","cross_cats_sorted":[],"title_canon_sha256":"09c8794cefc03e7d27540e069eea33cc169995b64f2d014bd6650f31e5dca32c","abstract_canon_sha256":"86730db63884df1640a849f64ca60abe1d06135f2909b81d6899949e4c088f09"},"schema_version":"1.0"},"canonical_sha256":"5e5b7936605eee461894c1bb4d15d7d7cc3a74f6b6cb3b75f42b22d95d17b5d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:34:49.828782Z","signature_b64":"qUJPcpTNoHnxBuj8Qo5VcaSAgEXFspC04JruPdV3jrTq/vMaNNZT7/AmcVJ/65Far5Rp3s/djFNOfKYpsdvFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e5b7936605eee461894c1bb4d15d7d7cc3a74f6b6cb3b75f42b22d95d17b5d2","last_reissued_at":"2026-07-05T03:34:49.828393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:34:49.828393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.12240","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-07-05T03:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQA2XZ/RMf4hEIuXnPtZ/ll/tkt0yu3JdxUJ3wrOeQF+HKZfvIkCpfZ0yXYtGFDYOKJ03m73EZ3Uz5dFpB0QDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:49:03.349189Z"},"content_sha256":"9b45b2207b78501d32b4b49e6f27c42a6b27ed89c3cf409e52a519ea95e80f72","schema_version":"1.0","event_id":"sha256:9b45b2207b78501d32b4b49e6f27c42a6b27ed89c3cf409e52a519ea95e80f72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:LZNXSNTAL3XEMGEUYG5U2FOX27","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper Bounds for Positive Semidefinite Propagation Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Small, Houston Schuerger, Kevin Liu, Leslie Hogben, Mark Hunnell, Yaqi Zhang","submitted_at":"2021-11-24T03:09:03Z","abstract_excerpt":"The tight upper bound $\\operatorname{pt}_+(G) \\leq \\left\\lceil \\frac{\\left\\vert \\operatorname{V}(G) \\right\\vert - \\operatorname{Z}_+(G)}{2} \\right\\rceil$ is established for the positive semidefinite propagation time of a graph in terms of its positive semidefinite zero forcing number. To prove this bound, two methods of transforming one positive semidefinite zero forcing set into another and algorithms implementing these methods are presented. Consequences of the bound, including a tight Nordhaus-Gaddum sum upper bound on positive semidefinite propagation time, are established."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.12240","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.12240/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VG7a742+y7Ichym/yMOe8nhgcljeBwlQIxGW5j++fabIctkrCSmWWWF8XHU1zhrcNLl0yvqru7GxnwGK0CSbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:49:03.349690Z"},"content_sha256":"82c3fa66552030689bd9a7b83dd3245fd115813445909044f18ea9b58b07b20a","schema_version":"1.0","event_id":"sha256:82c3fa66552030689bd9a7b83dd3245fd115813445909044f18ea9b58b07b20a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZNXSNTAL3XEMGEUYG5U2FOX27/bundle.json","state_url":"https://pith.science/pith/LZNXSNTAL3XEMGEUYG5U2FOX27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZNXSNTAL3XEMGEUYG5U2FOX27/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-08-12T16:49:03Z","links":{"resolver":"https://pith.science/pith/LZNXSNTAL3XEMGEUYG5U2FOX27","bundle":"https://pith.science/pith/LZNXSNTAL3XEMGEUYG5U2FOX27/bundle.json","state":"https://pith.science/pith/LZNXSNTAL3XEMGEUYG5U2FOX27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZNXSNTAL3XEMGEUYG5U2FOX27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:LZNXSNTAL3XEMGEUYG5U2FOX27","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":"86730db63884df1640a849f64ca60abe1d06135f2909b81d6899949e4c088f09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-24T03:09:03Z","title_canon_sha256":"09c8794cefc03e7d27540e069eea33cc169995b64f2d014bd6650f31e5dca32c"},"schema_version":"1.0","source":{"id":"2111.12240","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.12240","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"2111.12240v1","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12240","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"LZNXSNTAL3XE","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_16","alias_value":"LZNXSNTAL3XEMGEU","created_at":"2026-07-05T03:34:49Z"},{"alias_kind":"pith_short_8","alias_value":"LZNXSNTA","created_at":"2026-07-05T03:34:49Z"}],"graph_snapshots":[{"event_id":"sha256:82c3fa66552030689bd9a7b83dd3245fd115813445909044f18ea9b58b07b20a","target":"graph","created_at":"2026-07-05T03:34:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.12240/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The tight upper bound $\\operatorname{pt}_+(G) \\leq \\left\\lceil \\frac{\\left\\vert \\operatorname{V}(G) \\right\\vert - \\operatorname{Z}_+(G)}{2} \\right\\rceil$ is established for the positive semidefinite propagation time of a graph in terms of its positive semidefinite zero forcing number. To prove this bound, two methods of transforming one positive semidefinite zero forcing set into another and algorithms implementing these methods are presented. Consequences of the bound, including a tight Nordhaus-Gaddum sum upper bound on positive semidefinite propagation time, are established.","authors_text":"Ben Small, Houston Schuerger, Kevin Liu, Leslie Hogben, Mark Hunnell, Yaqi Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-24T03:09:03Z","title":"Upper Bounds for Positive Semidefinite Propagation Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.12240","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:9b45b2207b78501d32b4b49e6f27c42a6b27ed89c3cf409e52a519ea95e80f72","target":"record","created_at":"2026-07-05T03:34:49Z","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":"86730db63884df1640a849f64ca60abe1d06135f2909b81d6899949e4c088f09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-24T03:09:03Z","title_canon_sha256":"09c8794cefc03e7d27540e069eea33cc169995b64f2d014bd6650f31e5dca32c"},"schema_version":"1.0","source":{"id":"2111.12240","kind":"arxiv","version":1}},"canonical_sha256":"5e5b7936605eee461894c1bb4d15d7d7cc3a74f6b6cb3b75f42b22d95d17b5d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e5b7936605eee461894c1bb4d15d7d7cc3a74f6b6cb3b75f42b22d95d17b5d2","first_computed_at":"2026-07-05T03:34:49.828393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:34:49.828393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qUJPcpTNoHnxBuj8Qo5VcaSAgEXFspC04JruPdV3jrTq/vMaNNZT7/AmcVJ/65Far5Rp3s/djFNOfKYpsdvFDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:34:49.828782Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.12240","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b45b2207b78501d32b4b49e6f27c42a6b27ed89c3cf409e52a519ea95e80f72","sha256:82c3fa66552030689bd9a7b83dd3245fd115813445909044f18ea9b58b07b20a"],"state_sha256":"7d014b1af397a0bfd10bbf3e058ab3c941f0437a855900d3d233174af5b70056"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbUelnrteYeMFjm7NseO+ycgsrF1/Kt4MmDvNnNWNhAiM8W1i8pl1cZ60LmHpXBe9OHBddjbB8i6HwKRBbaHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T16:49:03.354748Z","bundle_sha256":"96702369773eee29409f33ecad041b7a810e7682d6a6631d13b91127d2af595e"}}