{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WV6UQ34JULT354XKOPWPJZF5NN","short_pith_number":"pith:WV6UQ34J","canonical_record":{"source":{"id":"1801.05318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-14T20:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"7beb51d526d2903b800e5ba59ba7a72ead4b16a4c31403a20598e0a77e741107","abstract_canon_sha256":"132575039f45267109017ad589166a327241316fc00e7ad4d80916e460e92084"},"schema_version":"1.0"},"canonical_sha256":"b57d486f89a2e7bef2ea73ecf4e4bd6b70ce84f4749d863773d09483e979cc09","source":{"kind":"arxiv","id":"1801.05318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05318","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05318v1","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05318","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"WV6UQ34JULT3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WV6UQ34JULT354XK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WV6UQ34J","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WV6UQ34JULT354XKOPWPJZF5NN","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-14T20:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"7beb51d526d2903b800e5ba59ba7a72ead4b16a4c31403a20598e0a77e741107","abstract_canon_sha256":"132575039f45267109017ad589166a327241316fc00e7ad4d80916e460e92084"},"schema_version":"1.0"},"canonical_sha256":"b57d486f89a2e7bef2ea73ecf4e4bd6b70ce84f4749d863773d09483e979cc09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:47.202117Z","signature_b64":"RZp41pyksZ2AiLtV/EZnL5LC2/F9akYZzYiFw3Yx3Yl+i60fuqkf4ZPSr95SRomOhLMmtZdtWNZDIgFBKn+OBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b57d486f89a2e7bef2ea73ecf4e4bd6b70ce84f4749d863773d09483e979cc09","last_reissued_at":"2026-05-18T00:25:47.201386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:47.201386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05318","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-18T00:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFNeqleQ30xm3v/Mu9qlYwMTlV0H6oyr1eVsZU57g+xDrdtvXgTCL7+PCeC9iaO6K7ZJsbP9HRwdgf+Had4+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:25:39.207682Z"},"content_sha256":"c2c05230e9fae806ebf4754ff3a577327297465d1288e9bb9bb7a5c78810ca6d","schema_version":"1.0","event_id":"sha256:c2c05230e9fae806ebf4754ff3a577327297465d1288e9bb9bb7a5c78810ca6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WV6UQ34JULT354XKOPWPJZF5NN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matching, Path Covers, and Total Forcing Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Henning, Randy Davila","submitted_at":"2018-01-14T20:48:49Z","abstract_excerpt":"A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $S$ of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to be colored. The initial set $S$ is called a forcing set of $G$ if, by iteratively applying the forcing process, every vertex in $G$ becomes colored. If the initial set $S$ has the added property that it induces a subgraph of $G$ without isolated vertices, then $S$ is called a total forcing set in $G$. The minimum cardinalit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05318","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-18T00:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLruKnRDbIiO4zzbx6snSBiN9lmMLdzneeEStfKhyanWVgiunHNYAdW+NNR1QiSdRvLZJLAEM/Gy745gDms4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:25:39.208032Z"},"content_sha256":"2956b07454937b21506921bf4e25b9cc10fb8f7feea48f882cbd51e45b86a3af","schema_version":"1.0","event_id":"sha256:2956b07454937b21506921bf4e25b9cc10fb8f7feea48f882cbd51e45b86a3af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WV6UQ34JULT354XKOPWPJZF5NN/bundle.json","state_url":"https://pith.science/pith/WV6UQ34JULT354XKOPWPJZF5NN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WV6UQ34JULT354XKOPWPJZF5NN/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-28T08:25:39Z","links":{"resolver":"https://pith.science/pith/WV6UQ34JULT354XKOPWPJZF5NN","bundle":"https://pith.science/pith/WV6UQ34JULT354XKOPWPJZF5NN/bundle.json","state":"https://pith.science/pith/WV6UQ34JULT354XKOPWPJZF5NN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WV6UQ34JULT354XKOPWPJZF5NN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WV6UQ34JULT354XKOPWPJZF5NN","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":"132575039f45267109017ad589166a327241316fc00e7ad4d80916e460e92084","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-14T20:48:49Z","title_canon_sha256":"7beb51d526d2903b800e5ba59ba7a72ead4b16a4c31403a20598e0a77e741107"},"schema_version":"1.0","source":{"id":"1801.05318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05318","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05318v1","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05318","created_at":"2026-05-18T00:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"WV6UQ34JULT3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WV6UQ34JULT354XK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WV6UQ34J","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:2956b07454937b21506921bf4e25b9cc10fb8f7feea48f882cbd51e45b86a3af","target":"graph","created_at":"2026-05-18T00:25:47Z","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":"A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $S$ of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to be colored. The initial set $S$ is called a forcing set of $G$ if, by iteratively applying the forcing process, every vertex in $G$ becomes colored. If the initial set $S$ has the added property that it induces a subgraph of $G$ without isolated vertices, then $S$ is called a total forcing set in $G$. The minimum cardinalit","authors_text":"Michael Henning, Randy Davila","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-14T20:48:49Z","title":"Matching, Path Covers, and Total Forcing Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05318","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:c2c05230e9fae806ebf4754ff3a577327297465d1288e9bb9bb7a5c78810ca6d","target":"record","created_at":"2026-05-18T00:25:47Z","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":"132575039f45267109017ad589166a327241316fc00e7ad4d80916e460e92084","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-14T20:48:49Z","title_canon_sha256":"7beb51d526d2903b800e5ba59ba7a72ead4b16a4c31403a20598e0a77e741107"},"schema_version":"1.0","source":{"id":"1801.05318","kind":"arxiv","version":1}},"canonical_sha256":"b57d486f89a2e7bef2ea73ecf4e4bd6b70ce84f4749d863773d09483e979cc09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b57d486f89a2e7bef2ea73ecf4e4bd6b70ce84f4749d863773d09483e979cc09","first_computed_at":"2026-05-18T00:25:47.201386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:47.201386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RZp41pyksZ2AiLtV/EZnL5LC2/F9akYZzYiFw3Yx3Yl+i60fuqkf4ZPSr95SRomOhLMmtZdtWNZDIgFBKn+OBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:47.202117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2c05230e9fae806ebf4754ff3a577327297465d1288e9bb9bb7a5c78810ca6d","sha256:2956b07454937b21506921bf4e25b9cc10fb8f7feea48f882cbd51e45b86a3af"],"state_sha256":"e0f3106c5949d85bf043ef58dcb713dedfabdcd0ea712f30fddc1c7023beac4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNzh7O13fs/hejfdBvqdCKwZEkObHGmaEc2XrkKpNaLfat2Uy2WLA3uJIYK6qVABLi43oLBFDlMUsAt7bhs3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:25:39.210008Z","bundle_sha256":"f6e47c9f8d2cd9e7a4d17e36f06a2c0de768e14ecafe4ea218231816622b07e2"}}