{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OP5Z4PNQLRPUU5FGZJLASUCCI6","short_pith_number":"pith:OP5Z4PNQ","canonical_record":{"source":{"id":"2508.07293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-10T11:05:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7bdd620c742e4960d7e8cd7e45b870a2a42fdb9edfd3fc15dbc17a64d73ba3ef","abstract_canon_sha256":"349523359e40104de808aff0724e577d19f7ba5a4e544974fa1c6855ed34f17e"},"schema_version":"1.0"},"canonical_sha256":"73fb9e3db05c5f4a74a6ca56095042479988f5d67d194aba64b9b4f98e822610","source":{"kind":"arxiv","id":"2508.07293","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07293","created_at":"2026-07-05T11:51:43Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07293v1","created_at":"2026-07-05T11:51:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07293","created_at":"2026-07-05T11:51:43Z"},{"alias_kind":"pith_short_12","alias_value":"OP5Z4PNQLRPU","created_at":"2026-07-05T11:51:43Z"},{"alias_kind":"pith_short_16","alias_value":"OP5Z4PNQLRPUU5FG","created_at":"2026-07-05T11:51:43Z"},{"alias_kind":"pith_short_8","alias_value":"OP5Z4PNQ","created_at":"2026-07-05T11:51:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OP5Z4PNQLRPUU5FGZJLASUCCI6","target":"record","payload":{"canonical_record":{"source":{"id":"2508.07293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-10T11:05:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7bdd620c742e4960d7e8cd7e45b870a2a42fdb9edfd3fc15dbc17a64d73ba3ef","abstract_canon_sha256":"349523359e40104de808aff0724e577d19f7ba5a4e544974fa1c6855ed34f17e"},"schema_version":"1.0"},"canonical_sha256":"73fb9e3db05c5f4a74a6ca56095042479988f5d67d194aba64b9b4f98e822610","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:43.943383Z","signature_b64":"i24O3frcyGcRbyP5U73WCywbKgLfuZkED36DAxrQiWcCFO9h6w9oy1VND7PRUrxsbyGBixFI/llSR1K/D/e+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73fb9e3db05c5f4a74a6ca56095042479988f5d67d194aba64b9b4f98e822610","last_reissued_at":"2026-07-05T11:51:43.942936Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:43.942936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.07293","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:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKeYYunOkwGvY51hL7zca8vRqCtQoPxEPl4Nc8hyY6i5fQA9iRUt7tAS/IVRPmw663ahVQ44GyoxqbYIifyqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:18:23.780174Z"},"content_sha256":"3487d17f55f98e0fb976c0a4c9d833c293dc285cf9efb0b680d3638daff02a5b","schema_version":"1.0","event_id":"sha256:3487d17f55f98e0fb976c0a4c9d833c293dc285cf9efb0b680d3638daff02a5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OP5Z4PNQLRPUU5FGZJLASUCCI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jonad Pulaj, Thomas R. Cameron","submitted_at":"2025-08-10T11:05:27Z","abstract_excerpt":"Zero forcing is a binary coloring game on a graph where a set of filled vertices can force non-filled vertices to become filled following a color change rule. In 2008, the zero forcing number of a graph was shown to be an upper bound on its maximum nullity. In addition, the combinatorial optimization problem for the zero forcing number was shown to be NP-hard. Since then, the study of zero forcing and its related parameters has received considerable attention. In 2018, the forts of a graph were defined as non-empty subsets of vertices where no vertex outside the set has exactly one neighbor in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07293","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/2508.07293/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:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t9OrUPg4WFhCg/0k3JKPF6GgFbcUVU6IeA6gNE+QZ7/nwi8/3LgbDWQXj+sgJXoI3HX7RENzBVoCGYVIWUuaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:18:23.780565Z"},"content_sha256":"69dc1a0490045fd31bcec9e16883a2b7296438de571be26c554a924b48bc0003","schema_version":"1.0","event_id":"sha256:69dc1a0490045fd31bcec9e16883a2b7296438de571be26c554a924b48bc0003"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OP5Z4PNQLRPUU5FGZJLASUCCI6/bundle.json","state_url":"https://pith.science/pith/OP5Z4PNQLRPUU5FGZJLASUCCI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OP5Z4PNQLRPUU5FGZJLASUCCI6/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-07T11:18:23Z","links":{"resolver":"https://pith.science/pith/OP5Z4PNQLRPUU5FGZJLASUCCI6","bundle":"https://pith.science/pith/OP5Z4PNQLRPUU5FGZJLASUCCI6/bundle.json","state":"https://pith.science/pith/OP5Z4PNQLRPUU5FGZJLASUCCI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OP5Z4PNQLRPUU5FGZJLASUCCI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OP5Z4PNQLRPUU5FGZJLASUCCI6","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":"349523359e40104de808aff0724e577d19f7ba5a4e544974fa1c6855ed34f17e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-10T11:05:27Z","title_canon_sha256":"7bdd620c742e4960d7e8cd7e45b870a2a42fdb9edfd3fc15dbc17a64d73ba3ef"},"schema_version":"1.0","source":{"id":"2508.07293","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07293","created_at":"2026-07-05T11:51:43Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07293v1","created_at":"2026-07-05T11:51:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07293","created_at":"2026-07-05T11:51:43Z"},{"alias_kind":"pith_short_12","alias_value":"OP5Z4PNQLRPU","created_at":"2026-07-05T11:51:43Z"},{"alias_kind":"pith_short_16","alias_value":"OP5Z4PNQLRPUU5FG","created_at":"2026-07-05T11:51:43Z"},{"alias_kind":"pith_short_8","alias_value":"OP5Z4PNQ","created_at":"2026-07-05T11:51:43Z"}],"graph_snapshots":[{"event_id":"sha256:69dc1a0490045fd31bcec9e16883a2b7296438de571be26c554a924b48bc0003","target":"graph","created_at":"2026-07-05T11:51:43Z","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/2508.07293/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Zero forcing is a binary coloring game on a graph where a set of filled vertices can force non-filled vertices to become filled following a color change rule. In 2008, the zero forcing number of a graph was shown to be an upper bound on its maximum nullity. In addition, the combinatorial optimization problem for the zero forcing number was shown to be NP-hard. Since then, the study of zero forcing and its related parameters has received considerable attention. In 2018, the forts of a graph were defined as non-empty subsets of vertices where no vertex outside the set has exactly one neighbor in","authors_text":"Jonad Pulaj, Thomas R. Cameron","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-10T11:05:27Z","title":"IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07293","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:3487d17f55f98e0fb976c0a4c9d833c293dc285cf9efb0b680d3638daff02a5b","target":"record","created_at":"2026-07-05T11:51:43Z","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":"349523359e40104de808aff0724e577d19f7ba5a4e544974fa1c6855ed34f17e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-10T11:05:27Z","title_canon_sha256":"7bdd620c742e4960d7e8cd7e45b870a2a42fdb9edfd3fc15dbc17a64d73ba3ef"},"schema_version":"1.0","source":{"id":"2508.07293","kind":"arxiv","version":1}},"canonical_sha256":"73fb9e3db05c5f4a74a6ca56095042479988f5d67d194aba64b9b4f98e822610","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73fb9e3db05c5f4a74a6ca56095042479988f5d67d194aba64b9b4f98e822610","first_computed_at":"2026-07-05T11:51:43.942936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:51:43.942936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i24O3frcyGcRbyP5U73WCywbKgLfuZkED36DAxrQiWcCFO9h6w9oy1VND7PRUrxsbyGBixFI/llSR1K/D/e+Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:51:43.943383Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.07293","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3487d17f55f98e0fb976c0a4c9d833c293dc285cf9efb0b680d3638daff02a5b","sha256:69dc1a0490045fd31bcec9e16883a2b7296438de571be26c554a924b48bc0003"],"state_sha256":"1e0953eef9a408eab66505cb72292091bafaa2c720b8d25caacfcf4ba87f7777"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1Zqbsx1DOL42dGjU7lrtnkFD5Vf/HG/sBxseTfWVN2vxDHrJEVRJgfCZxhDuK6HddS5xx5IFD3cLTQcvK2iAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:18:23.782559Z","bundle_sha256":"34194dd43f0a1ce40739b5a7c1652e45843f194a74eba0d7d6578387a47dc1cc"}}