{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QPT5PPL7HV26DH4QZFJ5M3A6QM","short_pith_number":"pith:QPT5PPL7","canonical_record":{"source":{"id":"1702.06496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T18:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"afd755075ac44bf08995f4edf2ba4b6304a0df70af0e9b1d8409a75fcfac5847","abstract_canon_sha256":"aecdf832119c70ca55866de2c030523e4ab1be044a32fc6825517b9167f045c7"},"schema_version":"1.0"},"canonical_sha256":"83e7d7bd7f3d75e19f90c953d66c1e8305e61a8a0e06ff3879f692f53751527f","source":{"kind":"arxiv","id":"1702.06496","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06496","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06496v1","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06496","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"pith_short_12","alias_value":"QPT5PPL7HV26","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QPT5PPL7HV26DH4Q","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QPT5PPL7","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QPT5PPL7HV26DH4QZFJ5M3A6QM","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T18:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"afd755075ac44bf08995f4edf2ba4b6304a0df70af0e9b1d8409a75fcfac5847","abstract_canon_sha256":"aecdf832119c70ca55866de2c030523e4ab1be044a32fc6825517b9167f045c7"},"schema_version":"1.0"},"canonical_sha256":"83e7d7bd7f3d75e19f90c953d66c1e8305e61a8a0e06ff3879f692f53751527f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:13.992585Z","signature_b64":"FnmTLtVUz6a/JCmaG0TmiP+JwzoRsnOrrWFJAx+89mcIl1KEy8FGCSJZbsdULplyFUVZ80dGgCgr3qKnCxlEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83e7d7bd7f3d75e19f90c953d66c1e8305e61a8a0e06ff3879f692f53751527f","last_reissued_at":"2026-05-18T00:50:13.991970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:13.991970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06496","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:50:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MTUPY1jYE7GxcseMLVgFtZamG/v5xja1N/aV20dvYnCHtqSvu07XBDC8gQjpyKH//CBVVJ8PDLcEioLtCctaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:09:07.999222Z"},"content_sha256":"41a697aac09b4fcc0d936286befa9e03b70d3c9d17a77db9ec3bf816adbc08d1","schema_version":"1.0","event_id":"sha256:41a697aac09b4fcc0d936286befa9e03b70d3c9d17a77db9ec3bf816adbc08d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QPT5PPL7HV26DH4QZFJ5M3A6QM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total Forcing Sets in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Henning, Randy Davila","submitted_at":"2017-02-21T18:01:01Z","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":"1702.06496","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:50:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFmKGFfZ6w4yh/FOr6e/aF7buuglOCDn6SmI1p3mNenT3r6ZnDUDTaMIvsVlRqLJ3taat4kKOygFWEBqPVmaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:09:07.999874Z"},"content_sha256":"acbec16a101123bdd1ce47706a7faadd83b8fb57dd087a84e522c8b74c640b20","schema_version":"1.0","event_id":"sha256:acbec16a101123bdd1ce47706a7faadd83b8fb57dd087a84e522c8b74c640b20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPT5PPL7HV26DH4QZFJ5M3A6QM/bundle.json","state_url":"https://pith.science/pith/QPT5PPL7HV26DH4QZFJ5M3A6QM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPT5PPL7HV26DH4QZFJ5M3A6QM/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-27T18:09:08Z","links":{"resolver":"https://pith.science/pith/QPT5PPL7HV26DH4QZFJ5M3A6QM","bundle":"https://pith.science/pith/QPT5PPL7HV26DH4QZFJ5M3A6QM/bundle.json","state":"https://pith.science/pith/QPT5PPL7HV26DH4QZFJ5M3A6QM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPT5PPL7HV26DH4QZFJ5M3A6QM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QPT5PPL7HV26DH4QZFJ5M3A6QM","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":"aecdf832119c70ca55866de2c030523e4ab1be044a32fc6825517b9167f045c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T18:01:01Z","title_canon_sha256":"afd755075ac44bf08995f4edf2ba4b6304a0df70af0e9b1d8409a75fcfac5847"},"schema_version":"1.0","source":{"id":"1702.06496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06496","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06496v1","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06496","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"pith_short_12","alias_value":"QPT5PPL7HV26","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QPT5PPL7HV26DH4Q","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QPT5PPL7","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:acbec16a101123bdd1ce47706a7faadd83b8fb57dd087a84e522c8b74c640b20","target":"graph","created_at":"2026-05-18T00:50:13Z","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":"2017-02-21T18:01:01Z","title":"Total Forcing Sets in Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06496","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:41a697aac09b4fcc0d936286befa9e03b70d3c9d17a77db9ec3bf816adbc08d1","target":"record","created_at":"2026-05-18T00:50:13Z","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":"aecdf832119c70ca55866de2c030523e4ab1be044a32fc6825517b9167f045c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T18:01:01Z","title_canon_sha256":"afd755075ac44bf08995f4edf2ba4b6304a0df70af0e9b1d8409a75fcfac5847"},"schema_version":"1.0","source":{"id":"1702.06496","kind":"arxiv","version":1}},"canonical_sha256":"83e7d7bd7f3d75e19f90c953d66c1e8305e61a8a0e06ff3879f692f53751527f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83e7d7bd7f3d75e19f90c953d66c1e8305e61a8a0e06ff3879f692f53751527f","first_computed_at":"2026-05-18T00:50:13.991970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:13.991970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FnmTLtVUz6a/JCmaG0TmiP+JwzoRsnOrrWFJAx+89mcIl1KEy8FGCSJZbsdULplyFUVZ80dGgCgr3qKnCxlEBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:13.992585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41a697aac09b4fcc0d936286befa9e03b70d3c9d17a77db9ec3bf816adbc08d1","sha256:acbec16a101123bdd1ce47706a7faadd83b8fb57dd087a84e522c8b74c640b20"],"state_sha256":"db56eae70de7acd6d817eb46ef8c59233b0fee8fe5e84115fa50af0a168d8ed2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADy/SgeJCCRDMfoa0d+lkhSM9yyxqhoIm62/K8iIuQEXX6r+AifcEON/SdqR55BuVDBJMyH3/d1VN/88rr8qBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:09:08.003514Z","bundle_sha256":"d7e4255ffd15a984bc4e1a4fc97ca3e8a41b0560e774ad291067f9f52cbb44fb"}}