{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E6EZEASQ2IWFZMJPFZTZJ2DBVO","short_pith_number":"pith:E6EZEASQ","canonical_record":{"source":{"id":"1801.08910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-26T17:39:20Z","cross_cats_sorted":[],"title_canon_sha256":"5ab4960096da6dc5622d6750bca62878fb301ad87f3283f8e865d69467e70180","abstract_canon_sha256":"be00ff39d2845044c16b2f9a0fffff35a067feed8b0cf7a938a4c1899578b5c2"},"schema_version":"1.0"},"canonical_sha256":"2789920250d22c5cb12f2e6794e861ab96d520390f84f3cfdb39ae143b84e3c0","source":{"kind":"arxiv","id":"1801.08910","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08910","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08910v1","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08910","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"E6EZEASQ2IWF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E6EZEASQ2IWFZMJP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E6EZEASQ","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E6EZEASQ2IWFZMJPFZTZJ2DBVO","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-26T17:39:20Z","cross_cats_sorted":[],"title_canon_sha256":"5ab4960096da6dc5622d6750bca62878fb301ad87f3283f8e865d69467e70180","abstract_canon_sha256":"be00ff39d2845044c16b2f9a0fffff35a067feed8b0cf7a938a4c1899578b5c2"},"schema_version":"1.0"},"canonical_sha256":"2789920250d22c5cb12f2e6794e861ab96d520390f84f3cfdb39ae143b84e3c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:56.850631Z","signature_b64":"W8fb8MFbNqypik529U470xlR8UU55+oRbiTfKlZZ6RePA3n2FE3AnVnJ7eUEhMR+82uVAfDrZG52yiGo024eAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2789920250d22c5cb12f2e6794e861ab96d520390f84f3cfdb39ae143b84e3c0","last_reissued_at":"2026-05-17T23:45:56.850112Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:56.850112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08910","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-17T23:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJl6CerrXqq9VdA6TeL4MCVJqsg785JU3hQDJ+JcJ85AwWiQpuOGRZkIbpKjnEnce7KfAZdEUJwaZ4ZSag6hAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:21:11.819522Z"},"content_sha256":"09c7f6c9ea4a07f0e152a7bf2d8de4ee8134b43cfbd14af97415ae5054ea1bcd","schema_version":"1.0","event_id":"sha256:09c7f6c9ea4a07f0e152a7bf2d8de4ee8134b43cfbd14af97415ae5054ea1bcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E6EZEASQ2IWFZMJPFZTZJ2DBVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The zero forcing polynomial of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ariel Keller, Boris Brimkov, Carolyn Reinhart, Daniela Ferrero, Kirk Boyer, Michael Phillips, Rachel Kirsch, Sean English","submitted_at":"2018-01-26T17:39:20Z","abstract_excerpt":"Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become colored. A zero forcing set is a set of initially colored vertices which causes the entire graph to eventually become colored. In this paper, we study the counting problem associated with zero forcing. We introduce the zero forcing polynomial of a graph $G$ of order $n$ as the polynomial $\\mathcal{Z}(G;x)=\\sum_{i=1}^n z(G;i) x^i$, where $z(G;i)$ is the number of zero forcing sets of $G$ of size $i$. We characteriz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08910","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-17T23:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X9Wgnu4N+RSvTwe5djZswQoHkjBNqLrv3kzATAA5d/XfEKfX5BRQzzm7/6yfAUmvUrxftwGOtvC8e2qtO72wDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:21:11.819878Z"},"content_sha256":"c6535e2e29b44896b34499c33b0b500a457d64e6d7de84845a4d3b161f5e83b3","schema_version":"1.0","event_id":"sha256:c6535e2e29b44896b34499c33b0b500a457d64e6d7de84845a4d3b161f5e83b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6EZEASQ2IWFZMJPFZTZJ2DBVO/bundle.json","state_url":"https://pith.science/pith/E6EZEASQ2IWFZMJPFZTZJ2DBVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6EZEASQ2IWFZMJPFZTZJ2DBVO/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-05-28T06:21:11Z","links":{"resolver":"https://pith.science/pith/E6EZEASQ2IWFZMJPFZTZJ2DBVO","bundle":"https://pith.science/pith/E6EZEASQ2IWFZMJPFZTZJ2DBVO/bundle.json","state":"https://pith.science/pith/E6EZEASQ2IWFZMJPFZTZJ2DBVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6EZEASQ2IWFZMJPFZTZJ2DBVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E6EZEASQ2IWFZMJPFZTZJ2DBVO","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":"be00ff39d2845044c16b2f9a0fffff35a067feed8b0cf7a938a4c1899578b5c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-26T17:39:20Z","title_canon_sha256":"5ab4960096da6dc5622d6750bca62878fb301ad87f3283f8e865d69467e70180"},"schema_version":"1.0","source":{"id":"1801.08910","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08910","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08910v1","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08910","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"E6EZEASQ2IWF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E6EZEASQ2IWFZMJP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E6EZEASQ","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:c6535e2e29b44896b34499c33b0b500a457d64e6d7de84845a4d3b161f5e83b3","target":"graph","created_at":"2026-05-17T23:45:56Z","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":"Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become colored. A zero forcing set is a set of initially colored vertices which causes the entire graph to eventually become colored. In this paper, we study the counting problem associated with zero forcing. We introduce the zero forcing polynomial of a graph $G$ of order $n$ as the polynomial $\\mathcal{Z}(G;x)=\\sum_{i=1}^n z(G;i) x^i$, where $z(G;i)$ is the number of zero forcing sets of $G$ of size $i$. We characteriz","authors_text":"Ariel Keller, Boris Brimkov, Carolyn Reinhart, Daniela Ferrero, Kirk Boyer, Michael Phillips, Rachel Kirsch, Sean English","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-26T17:39:20Z","title":"The zero forcing polynomial of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08910","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:09c7f6c9ea4a07f0e152a7bf2d8de4ee8134b43cfbd14af97415ae5054ea1bcd","target":"record","created_at":"2026-05-17T23:45:56Z","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":"be00ff39d2845044c16b2f9a0fffff35a067feed8b0cf7a938a4c1899578b5c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-26T17:39:20Z","title_canon_sha256":"5ab4960096da6dc5622d6750bca62878fb301ad87f3283f8e865d69467e70180"},"schema_version":"1.0","source":{"id":"1801.08910","kind":"arxiv","version":1}},"canonical_sha256":"2789920250d22c5cb12f2e6794e861ab96d520390f84f3cfdb39ae143b84e3c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2789920250d22c5cb12f2e6794e861ab96d520390f84f3cfdb39ae143b84e3c0","first_computed_at":"2026-05-17T23:45:56.850112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:56.850112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W8fb8MFbNqypik529U470xlR8UU55+oRbiTfKlZZ6RePA3n2FE3AnVnJ7eUEhMR+82uVAfDrZG52yiGo024eAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:56.850631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08910","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09c7f6c9ea4a07f0e152a7bf2d8de4ee8134b43cfbd14af97415ae5054ea1bcd","sha256:c6535e2e29b44896b34499c33b0b500a457d64e6d7de84845a4d3b161f5e83b3"],"state_sha256":"741fc8aeacc3c5a63298e797ecd662e008737e4a74fc0005422abeb57fcce0ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ET2cYD+a/XORqNmzuarYvaMll56F8JYFqaoAybDJE21Vq95wOD4jjNcRHxg3j4og66ai+LpRLkmvsFCewUjsAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:21:11.821761Z","bundle_sha256":"e6b26314ff79231fc64bcbf294477748f84454b12a71fd02492320eb1d0ace98"}}