{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:YR674YB6VL5DPJH3VA6DS7TY7U","short_pith_number":"pith:YR674YB6","canonical_record":{"source":{"id":"2406.19231","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-27T14:54:56Z","cross_cats_sorted":[],"title_canon_sha256":"7e6f60a6953bc1029398fc3cd9978db9aed1ca54babd6cb6c2d86ce35c8fed55","abstract_canon_sha256":"97237d932a1cc349c5ab097422de81f0ad280011a69f523586fc25421d9d5782"},"schema_version":"1.0"},"canonical_sha256":"c47dfe603eaafa37a4fba83c397e78fd3113bdd32f7c140f2cfdf5c4d5ea6fcf","source":{"kind":"arxiv","id":"2406.19231","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.19231","created_at":"2026-07-05T09:37:08Z"},{"alias_kind":"arxiv_version","alias_value":"2406.19231v2","created_at":"2026-07-05T09:37:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19231","created_at":"2026-07-05T09:37:08Z"},{"alias_kind":"pith_short_12","alias_value":"YR674YB6VL5D","created_at":"2026-07-05T09:37:08Z"},{"alias_kind":"pith_short_16","alias_value":"YR674YB6VL5DPJH3","created_at":"2026-07-05T09:37:08Z"},{"alias_kind":"pith_short_8","alias_value":"YR674YB6","created_at":"2026-07-05T09:37:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:YR674YB6VL5DPJH3VA6DS7TY7U","target":"record","payload":{"canonical_record":{"source":{"id":"2406.19231","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-27T14:54:56Z","cross_cats_sorted":[],"title_canon_sha256":"7e6f60a6953bc1029398fc3cd9978db9aed1ca54babd6cb6c2d86ce35c8fed55","abstract_canon_sha256":"97237d932a1cc349c5ab097422de81f0ad280011a69f523586fc25421d9d5782"},"schema_version":"1.0"},"canonical_sha256":"c47dfe603eaafa37a4fba83c397e78fd3113bdd32f7c140f2cfdf5c4d5ea6fcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:08.960925Z","signature_b64":"hNNv6Bo1SfTTvNup+BKJzPrm9/JwWdHPR4zJlSN0Vfwk13fO+LFnTof+GpkcEtuLSlhF9/izdMuISC7OIg/9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c47dfe603eaafa37a4fba83c397e78fd3113bdd32f7c140f2cfdf5c4d5ea6fcf","last_reissued_at":"2026-07-05T09:37:08.960475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:08.960475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.19231","source_version":2,"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-05T09:37:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VX/qoE47S/as2b28qJJ5aV5TLKO5A0eGAElQW/tO8VrUuASKCWsk5t6kkkRYKmqPs7c5dZ7DD0PxtKcyARgCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:36:32.968814Z"},"content_sha256":"891c5c3990df0e4cdf874a5d59b8ae31a34fc3bd16303de581fd52d9d06e4d48","schema_version":"1.0","event_id":"sha256:891c5c3990df0e4cdf874a5d59b8ae31a34fc3bd16303de581fd52d9d06e4d48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:YR674YB6VL5DPJH3VA6DS7TY7U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Another conjecture of TxGraffiti concerning zero forcing and domination in graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Randy R. Davila","submitted_at":"2024-06-27T14:54:56Z","abstract_excerpt":"This paper proves a conjecture generated by the artificial intelligence conjecturing program called \\emph{TxGraffiti}. More specifically, we show that if $G$ is a connected, cubic, and claw-free graph, then $Z(G) \\le \\gamma(G) + 2$, where $Z(G)$ and $\\gamma(G)$ denote the zero forcing number and the domination number of $G$, respectively. Furthermore, we provide a complete characterization of graphs that achieve this bound. Notably, this bound improves the known upper bounds for the zero forcing number of connected, cubic, and claw-free graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19231","kind":"arxiv","version":2},"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/2406.19231/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-05T09:37:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPtsAQ+9fea8Bi+kJoCL5lsnSo3+h/e/fl+V3kcu9kquJ0LbXj90VlUfz932vGc27nvqq9tkGFmll5enrlVdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:36:32.969325Z"},"content_sha256":"c82562c549e2d9661c8e7ff0b20697c6072656ff1f48046fb4d9452f62392dd1","schema_version":"1.0","event_id":"sha256:c82562c549e2d9661c8e7ff0b20697c6072656ff1f48046fb4d9452f62392dd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YR674YB6VL5DPJH3VA6DS7TY7U/bundle.json","state_url":"https://pith.science/pith/YR674YB6VL5DPJH3VA6DS7TY7U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YR674YB6VL5DPJH3VA6DS7TY7U/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-08-14T07:36:32Z","links":{"resolver":"https://pith.science/pith/YR674YB6VL5DPJH3VA6DS7TY7U","bundle":"https://pith.science/pith/YR674YB6VL5DPJH3VA6DS7TY7U/bundle.json","state":"https://pith.science/pith/YR674YB6VL5DPJH3VA6DS7TY7U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YR674YB6VL5DPJH3VA6DS7TY7U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:YR674YB6VL5DPJH3VA6DS7TY7U","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":"97237d932a1cc349c5ab097422de81f0ad280011a69f523586fc25421d9d5782","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-27T14:54:56Z","title_canon_sha256":"7e6f60a6953bc1029398fc3cd9978db9aed1ca54babd6cb6c2d86ce35c8fed55"},"schema_version":"1.0","source":{"id":"2406.19231","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.19231","created_at":"2026-07-05T09:37:08Z"},{"alias_kind":"arxiv_version","alias_value":"2406.19231v2","created_at":"2026-07-05T09:37:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19231","created_at":"2026-07-05T09:37:08Z"},{"alias_kind":"pith_short_12","alias_value":"YR674YB6VL5D","created_at":"2026-07-05T09:37:08Z"},{"alias_kind":"pith_short_16","alias_value":"YR674YB6VL5DPJH3","created_at":"2026-07-05T09:37:08Z"},{"alias_kind":"pith_short_8","alias_value":"YR674YB6","created_at":"2026-07-05T09:37:08Z"}],"graph_snapshots":[{"event_id":"sha256:c82562c549e2d9661c8e7ff0b20697c6072656ff1f48046fb4d9452f62392dd1","target":"graph","created_at":"2026-07-05T09:37:08Z","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/2406.19231/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proves a conjecture generated by the artificial intelligence conjecturing program called \\emph{TxGraffiti}. More specifically, we show that if $G$ is a connected, cubic, and claw-free graph, then $Z(G) \\le \\gamma(G) + 2$, where $Z(G)$ and $\\gamma(G)$ denote the zero forcing number and the domination number of $G$, respectively. Furthermore, we provide a complete characterization of graphs that achieve this bound. Notably, this bound improves the known upper bounds for the zero forcing number of connected, cubic, and claw-free graphs.","authors_text":"Randy R. Davila","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-27T14:54:56Z","title":"Another conjecture of TxGraffiti concerning zero forcing and domination in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19231","kind":"arxiv","version":2},"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:891c5c3990df0e4cdf874a5d59b8ae31a34fc3bd16303de581fd52d9d06e4d48","target":"record","created_at":"2026-07-05T09:37:08Z","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":"97237d932a1cc349c5ab097422de81f0ad280011a69f523586fc25421d9d5782","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-27T14:54:56Z","title_canon_sha256":"7e6f60a6953bc1029398fc3cd9978db9aed1ca54babd6cb6c2d86ce35c8fed55"},"schema_version":"1.0","source":{"id":"2406.19231","kind":"arxiv","version":2}},"canonical_sha256":"c47dfe603eaafa37a4fba83c397e78fd3113bdd32f7c140f2cfdf5c4d5ea6fcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c47dfe603eaafa37a4fba83c397e78fd3113bdd32f7c140f2cfdf5c4d5ea6fcf","first_computed_at":"2026-07-05T09:37:08.960475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:37:08.960475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hNNv6Bo1SfTTvNup+BKJzPrm9/JwWdHPR4zJlSN0Vfwk13fO+LFnTof+GpkcEtuLSlhF9/izdMuISC7OIg/9Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:37:08.960925Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.19231","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:891c5c3990df0e4cdf874a5d59b8ae31a34fc3bd16303de581fd52d9d06e4d48","sha256:c82562c549e2d9661c8e7ff0b20697c6072656ff1f48046fb4d9452f62392dd1"],"state_sha256":"972e50872a7b35c3770eb31d929d96d028c32e1fba004216b051066f7cac093e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P70JXwtWkMMqX7/crRomlP17LQexj8mHhc7j6FPHapdh1ObztsPokV4FH3nOKSlhVdvcI4AciiQsyr/ZRELpBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T07:36:32.972742Z","bundle_sha256":"a554b6ed37e951311d45497b5d6be7e33ca2c79a746d02830b4f0ff17c638bee"}}