{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4EN6MQE7AVCOT7O4XPYCAICML6","short_pith_number":"pith:4EN6MQE7","canonical_record":{"source":{"id":"2507.10826","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T21:44:16Z","cross_cats_sorted":[],"title_canon_sha256":"5d028d5a3c4113e2ccfd07ff573bce24616636ddef652f42d41c8c3e797c2ac4","abstract_canon_sha256":"d207a23b7ab0ce248febce96bcf2e0c4474bb855ada5a4af5d2bb49495e11e32"},"schema_version":"1.0"},"canonical_sha256":"e11be6409f0544e9fddcbbf020204c5fa045596326631a706696e2001db00d98","source":{"kind":"arxiv","id":"2507.10826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.10826","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.10826v1","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10826","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_12","alias_value":"4EN6MQE7AVCO","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_16","alias_value":"4EN6MQE7AVCOT7O4","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_8","alias_value":"4EN6MQE7","created_at":"2026-07-05T11:37:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4EN6MQE7AVCOT7O4XPYCAICML6","target":"record","payload":{"canonical_record":{"source":{"id":"2507.10826","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T21:44:16Z","cross_cats_sorted":[],"title_canon_sha256":"5d028d5a3c4113e2ccfd07ff573bce24616636ddef652f42d41c8c3e797c2ac4","abstract_canon_sha256":"d207a23b7ab0ce248febce96bcf2e0c4474bb855ada5a4af5d2bb49495e11e32"},"schema_version":"1.0"},"canonical_sha256":"e11be6409f0544e9fddcbbf020204c5fa045596326631a706696e2001db00d98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:00.363035Z","signature_b64":"RS5DLEv5NUusKusiaPKdwFUMZjKUZU1h0l74mkcq1F5tHrOFrua1T5HEHpAmaIGKvJOcB9TKUw6+KbxRhCf3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e11be6409f0544e9fddcbbf020204c5fa045596326631a706696e2001db00d98","last_reissued_at":"2026-07-05T11:37:00.362571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:00.362571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.10826","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-05T11:37:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtcMWQJuUoRwJLp/b7KY//GQF8TNZGfwWTNPkALSlbg+Mv7NpkrmgyXPmMY6jxnBHuL50Qh5j97Sjv/slVEzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:56:24.420907Z"},"content_sha256":"015c934296fc73e606ea2917f915d8c8d050cb244165bda451a45ee04221b8a2","schema_version":"1.0","event_id":"sha256:015c934296fc73e606ea2917f915d8c8d050cb244165bda451a45ee04221b8a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4EN6MQE7AVCOT7O4XPYCAICML6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the forts and related parameters of the hypercube graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Brimkov, Owen Grubbs, Thomas R. Cameron","submitted_at":"2025-07-14T21:44:16Z","abstract_excerpt":"In 2018, forts were defined as non-empty subsets of vertices in a graph where no vertex outside the set has exactly one neighbor in the set. Forts have since been used to characterize zero forcing sets, model zero forcing as an integer program, and provide lower bounds on the zero forcing number. In this article, we give a complete characterization of minimum forts in the hypercube graph, showing that they are automorphic to one of two sets. In contrast, non-automorphic minimum zero forcing sets are identified with distinct propagation times. We also derive the fractional zero forcing number a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10826","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/2507.10826/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-05T11:37:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"II+q3ZpU5InwYSDqywkYHBkP1fFyyWMwlsETKb/6ZMcEubcqJHaISfumpONzOGX7rIK6/B2lPT1zLFwjR5sMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:56:24.421291Z"},"content_sha256":"6fb6b824d50719386aa281402823dbdf7a241042d99d4f4364d9304a577ae7cc","schema_version":"1.0","event_id":"sha256:6fb6b824d50719386aa281402823dbdf7a241042d99d4f4364d9304a577ae7cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EN6MQE7AVCOT7O4XPYCAICML6/bundle.json","state_url":"https://pith.science/pith/4EN6MQE7AVCOT7O4XPYCAICML6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EN6MQE7AVCOT7O4XPYCAICML6/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-07T07:56:24Z","links":{"resolver":"https://pith.science/pith/4EN6MQE7AVCOT7O4XPYCAICML6","bundle":"https://pith.science/pith/4EN6MQE7AVCOT7O4XPYCAICML6/bundle.json","state":"https://pith.science/pith/4EN6MQE7AVCOT7O4XPYCAICML6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EN6MQE7AVCOT7O4XPYCAICML6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4EN6MQE7AVCOT7O4XPYCAICML6","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":"d207a23b7ab0ce248febce96bcf2e0c4474bb855ada5a4af5d2bb49495e11e32","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T21:44:16Z","title_canon_sha256":"5d028d5a3c4113e2ccfd07ff573bce24616636ddef652f42d41c8c3e797c2ac4"},"schema_version":"1.0","source":{"id":"2507.10826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.10826","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.10826v1","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10826","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_12","alias_value":"4EN6MQE7AVCO","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_16","alias_value":"4EN6MQE7AVCOT7O4","created_at":"2026-07-05T11:37:00Z"},{"alias_kind":"pith_short_8","alias_value":"4EN6MQE7","created_at":"2026-07-05T11:37:00Z"}],"graph_snapshots":[{"event_id":"sha256:6fb6b824d50719386aa281402823dbdf7a241042d99d4f4364d9304a577ae7cc","target":"graph","created_at":"2026-07-05T11:37:00Z","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/2507.10826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 2018, forts were defined as non-empty subsets of vertices in a graph where no vertex outside the set has exactly one neighbor in the set. Forts have since been used to characterize zero forcing sets, model zero forcing as an integer program, and provide lower bounds on the zero forcing number. In this article, we give a complete characterization of minimum forts in the hypercube graph, showing that they are automorphic to one of two sets. In contrast, non-automorphic minimum zero forcing sets are identified with distinct propagation times. We also derive the fractional zero forcing number a","authors_text":"Boris Brimkov, Owen Grubbs, Thomas R. Cameron","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T21:44:16Z","title":"On the forts and related parameters of the hypercube graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10826","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:015c934296fc73e606ea2917f915d8c8d050cb244165bda451a45ee04221b8a2","target":"record","created_at":"2026-07-05T11:37:00Z","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":"d207a23b7ab0ce248febce96bcf2e0c4474bb855ada5a4af5d2bb49495e11e32","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T21:44:16Z","title_canon_sha256":"5d028d5a3c4113e2ccfd07ff573bce24616636ddef652f42d41c8c3e797c2ac4"},"schema_version":"1.0","source":{"id":"2507.10826","kind":"arxiv","version":1}},"canonical_sha256":"e11be6409f0544e9fddcbbf020204c5fa045596326631a706696e2001db00d98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e11be6409f0544e9fddcbbf020204c5fa045596326631a706696e2001db00d98","first_computed_at":"2026-07-05T11:37:00.362571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:00.362571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RS5DLEv5NUusKusiaPKdwFUMZjKUZU1h0l74mkcq1F5tHrOFrua1T5HEHpAmaIGKvJOcB9TKUw6+KbxRhCf3Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:00.363035Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.10826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:015c934296fc73e606ea2917f915d8c8d050cb244165bda451a45ee04221b8a2","sha256:6fb6b824d50719386aa281402823dbdf7a241042d99d4f4364d9304a577ae7cc"],"state_sha256":"80065d62e44aa6d3230054600ad130080704a9fd36f4f3f3459ed2a4acb81d0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOsAAkHg7U0o7rRN3r/TV48y32JnfbCUmQsjDrs3GEnsj0U7vx2IqLnpJgpzVg2tdL9IC18jsqkA4d3PX6k/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:56:24.423396Z","bundle_sha256":"2ac419a7b994e49c1e1f3580c891e4883544669653c2282ca501b383f59e75ce"}}