{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AEZZJZNZH2SSJAGQMOKIRIZRYT","short_pith_number":"pith:AEZZJZNZ","canonical_record":{"source":{"id":"2404.05963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T02:51:32Z","cross_cats_sorted":[],"title_canon_sha256":"025cfe669104794875f401d8c250bee84642cf09c4fbc32e2fb9d4f4448507e1","abstract_canon_sha256":"174c3465a2ecdb5b769bf28711137647db084a3586df9532d2f84f60ee3f0ed5"},"schema_version":"1.0"},"canonical_sha256":"013394e5b93ea52480d0639488a331c4e1cd1a7660d8ebf46fe98c736197f122","source":{"kind":"arxiv","id":"2404.05963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.05963","created_at":"2026-07-05T08:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2404.05963v1","created_at":"2026-07-05T08:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05963","created_at":"2026-07-05T08:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"AEZZJZNZH2SS","created_at":"2026-07-05T08:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"AEZZJZNZH2SSJAGQ","created_at":"2026-07-05T08:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"AEZZJZNZ","created_at":"2026-07-05T08:06:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AEZZJZNZH2SSJAGQMOKIRIZRYT","target":"record","payload":{"canonical_record":{"source":{"id":"2404.05963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T02:51:32Z","cross_cats_sorted":[],"title_canon_sha256":"025cfe669104794875f401d8c250bee84642cf09c4fbc32e2fb9d4f4448507e1","abstract_canon_sha256":"174c3465a2ecdb5b769bf28711137647db084a3586df9532d2f84f60ee3f0ed5"},"schema_version":"1.0"},"canonical_sha256":"013394e5b93ea52480d0639488a331c4e1cd1a7660d8ebf46fe98c736197f122","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:01.637055Z","signature_b64":"Z9S0vIGx3tPHMS//0y5KjNbX768n8hM5B2r6lXxoZh7C8FBt7FpaDperDndT+11qMyaikTdS2j3M1OTvT9J5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"013394e5b93ea52480d0639488a331c4e1cd1a7660d8ebf46fe98c736197f122","last_reissued_at":"2026-07-05T08:06:01.636536Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:01.636536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.05963","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-05T08:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMf1Cv3YXaqgoXRMpQVzcKhEcTHTvUEnrVd6Yaz4Gzsv6ZQ9dOMll7wQYNpvDyrFKqi8l4sZ39cZEup6xSe1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:50:15.911896Z"},"content_sha256":"71890e92f8e2e4ce3c05df1aa6c189c46206f171e61d11292feb5e405f2d73dc","schema_version":"1.0","event_id":"sha256:71890e92f8e2e4ce3c05df1aa6c189c46206f171e61d11292feb5e405f2d73dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AEZZJZNZH2SSJAGQMOKIRIZRYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of minimal forts of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boon Ong, Derek Hanely, Joseph P. Previte, Paul Becker, Thomas R. Cameron","submitted_at":"2024-04-09T02:51:32Z","abstract_excerpt":"In 2018, a fort of a graph was introduced as a non-empty subset of vertices in which no vertex outside of the set has exactly one neighbor in the set. Since then, forts have been used to characterize zero forcing sets, model the zero forcing number as an integer program, and generate lower bounds on the zero forcing number of a Cartesian product. In this article, we investigate the number of minimal forts of a graph, where a fort is minimal if every proper subset is not a fort. In particular, we show that the number of minimal forts of a graph of order at least six is strictly less than Sperne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05963","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/2404.05963/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-05T08:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Qx65MzPcqFNm3bgbzBmVYg5MkLVHPvxvFrzf1UYkEp/EwAXhevAWnRWhMvFe3m+Vts82hRyW1n2o7S/23zYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:50:15.912267Z"},"content_sha256":"450d89513124ad87d9b6fb659d3d18f1822f0d4d48ffd73c41f066a27088151b","schema_version":"1.0","event_id":"sha256:450d89513124ad87d9b6fb659d3d18f1822f0d4d48ffd73c41f066a27088151b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEZZJZNZH2SSJAGQMOKIRIZRYT/bundle.json","state_url":"https://pith.science/pith/AEZZJZNZH2SSJAGQMOKIRIZRYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEZZJZNZH2SSJAGQMOKIRIZRYT/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-07T13:50:15Z","links":{"resolver":"https://pith.science/pith/AEZZJZNZH2SSJAGQMOKIRIZRYT","bundle":"https://pith.science/pith/AEZZJZNZH2SSJAGQMOKIRIZRYT/bundle.json","state":"https://pith.science/pith/AEZZJZNZH2SSJAGQMOKIRIZRYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEZZJZNZH2SSJAGQMOKIRIZRYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AEZZJZNZH2SSJAGQMOKIRIZRYT","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":"174c3465a2ecdb5b769bf28711137647db084a3586df9532d2f84f60ee3f0ed5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T02:51:32Z","title_canon_sha256":"025cfe669104794875f401d8c250bee84642cf09c4fbc32e2fb9d4f4448507e1"},"schema_version":"1.0","source":{"id":"2404.05963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.05963","created_at":"2026-07-05T08:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2404.05963v1","created_at":"2026-07-05T08:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05963","created_at":"2026-07-05T08:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"AEZZJZNZH2SS","created_at":"2026-07-05T08:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"AEZZJZNZH2SSJAGQ","created_at":"2026-07-05T08:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"AEZZJZNZ","created_at":"2026-07-05T08:06:01Z"}],"graph_snapshots":[{"event_id":"sha256:450d89513124ad87d9b6fb659d3d18f1822f0d4d48ffd73c41f066a27088151b","target":"graph","created_at":"2026-07-05T08:06:01Z","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/2404.05963/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 2018, a fort of a graph was introduced as a non-empty subset of vertices in which no vertex outside of the set has exactly one neighbor in the set. Since then, forts have been used to characterize zero forcing sets, model the zero forcing number as an integer program, and generate lower bounds on the zero forcing number of a Cartesian product. In this article, we investigate the number of minimal forts of a graph, where a fort is minimal if every proper subset is not a fort. In particular, we show that the number of minimal forts of a graph of order at least six is strictly less than Sperne","authors_text":"Boon Ong, Derek Hanely, Joseph P. Previte, Paul Becker, Thomas R. Cameron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T02:51:32Z","title":"On the number of minimal forts of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05963","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:71890e92f8e2e4ce3c05df1aa6c189c46206f171e61d11292feb5e405f2d73dc","target":"record","created_at":"2026-07-05T08:06:01Z","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":"174c3465a2ecdb5b769bf28711137647db084a3586df9532d2f84f60ee3f0ed5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-09T02:51:32Z","title_canon_sha256":"025cfe669104794875f401d8c250bee84642cf09c4fbc32e2fb9d4f4448507e1"},"schema_version":"1.0","source":{"id":"2404.05963","kind":"arxiv","version":1}},"canonical_sha256":"013394e5b93ea52480d0639488a331c4e1cd1a7660d8ebf46fe98c736197f122","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"013394e5b93ea52480d0639488a331c4e1cd1a7660d8ebf46fe98c736197f122","first_computed_at":"2026-07-05T08:06:01.636536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:06:01.636536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z9S0vIGx3tPHMS//0y5KjNbX768n8hM5B2r6lXxoZh7C8FBt7FpaDperDndT+11qMyaikTdS2j3M1OTvT9J5DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:06:01.637055Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.05963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71890e92f8e2e4ce3c05df1aa6c189c46206f171e61d11292feb5e405f2d73dc","sha256:450d89513124ad87d9b6fb659d3d18f1822f0d4d48ffd73c41f066a27088151b"],"state_sha256":"dc62d2108b6382e7537432b9889e8dff5d6b7461ff21174ad72129739b30e27d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2lrPBhZb5592el1YxAtl7wMqozipFqqo4x84OiS2B/6mKlXjDBxGiDfbnN7ZYw1YshbzUlyzK5yrZkoisKeCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:50:15.914534Z","bundle_sha256":"d077b54404c6be4138b29492f9ce8e701f082ddfb7d1b9c616c5519ac40d0ae3"}}