{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HA325EWQGRHSFRRM6CHS44UUN5","short_pith_number":"pith:HA325EWQ","schema_version":"1.0","canonical_sha256":"3837ae92d0344f22c62cf08f2e72946f5b4b7c2dbb087c0a0d62a573403a74c7","source":{"kind":"arxiv","id":"2412.03463","version":2},"attestation_state":"computed","paper":{"title":"A Characterization of Claw-Free Graphs using Zero Forcing Invariants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Small, Houston Schuerger, Randy Davila","submitted_at":"2024-12-04T16:52:21Z","abstract_excerpt":"We prove that the \\emph{standard zero forcing number} $Z(G)$ and the \\emph{positive semidefinite zero forcing number} $Z_+(G)$ are equal for all claw-free graphs $G$. This result resolves a conjecture proposed by the computer program \\emph{TxGraffiti} and highlights a connection between these graph invariants in claw-free structures. As a corollary, we show that a graph $G$ is claw-free if and only if every induced subgraph $H \\subseteq G$ satisfies $Z(H) = Z_+(H)$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.03463","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-04T16:52:21Z","cross_cats_sorted":[],"title_canon_sha256":"1541f4dd11f6474fd615fc761207e8bde72b69df17241da6fb7bd69a0165deac","abstract_canon_sha256":"ffc59f4f5f65b01c1e3035092e1c7a95f41be769e4069870860c32a540ae6381"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:54.746952Z","signature_b64":"R54AOCNx64XM/2Quj+us+U8HDQ4tRBGAzd1LixRFxrOcXIQqsBFk9NP5HHTEdQLrE/ze3bV8ywcx7OCJhfIvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3837ae92d0344f22c62cf08f2e72946f5b4b7c2dbb087c0a0d62a573403a74c7","last_reissued_at":"2026-07-05T09:50:54.746547Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:54.746547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Characterization of Claw-Free Graphs using Zero Forcing Invariants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Small, Houston Schuerger, Randy Davila","submitted_at":"2024-12-04T16:52:21Z","abstract_excerpt":"We prove that the \\emph{standard zero forcing number} $Z(G)$ and the \\emph{positive semidefinite zero forcing number} $Z_+(G)$ are equal for all claw-free graphs $G$. This result resolves a conjecture proposed by the computer program \\emph{TxGraffiti} and highlights a connection between these graph invariants in claw-free structures. As a corollary, we show that a graph $G$ is claw-free if and only if every induced subgraph $H \\subseteq G$ satisfies $Z(H) = Z_+(H)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03463","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/2412.03463/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.03463","created_at":"2026-07-05T09:50:54.746600+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.03463v2","created_at":"2026-07-05T09:50:54.746600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03463","created_at":"2026-07-05T09:50:54.746600+00:00"},{"alias_kind":"pith_short_12","alias_value":"HA325EWQGRHS","created_at":"2026-07-05T09:50:54.746600+00:00"},{"alias_kind":"pith_short_16","alias_value":"HA325EWQGRHSFRRM","created_at":"2026-07-05T09:50:54.746600+00:00"},{"alias_kind":"pith_short_8","alias_value":"HA325EWQ","created_at":"2026-07-05T09:50:54.746600+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17780","citing_title":"In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HA325EWQGRHSFRRM6CHS44UUN5","json":"https://pith.science/pith/HA325EWQGRHSFRRM6CHS44UUN5.json","graph_json":"https://pith.science/api/pith-number/HA325EWQGRHSFRRM6CHS44UUN5/graph.json","events_json":"https://pith.science/api/pith-number/HA325EWQGRHSFRRM6CHS44UUN5/events.json","paper":"https://pith.science/paper/HA325EWQ"},"agent_actions":{"view_html":"https://pith.science/pith/HA325EWQGRHSFRRM6CHS44UUN5","download_json":"https://pith.science/pith/HA325EWQGRHSFRRM6CHS44UUN5.json","view_paper":"https://pith.science/paper/HA325EWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.03463&json=true","fetch_graph":"https://pith.science/api/pith-number/HA325EWQGRHSFRRM6CHS44UUN5/graph.json","fetch_events":"https://pith.science/api/pith-number/HA325EWQGRHSFRRM6CHS44UUN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HA325EWQGRHSFRRM6CHS44UUN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HA325EWQGRHSFRRM6CHS44UUN5/action/storage_attestation","attest_author":"https://pith.science/pith/HA325EWQGRHSFRRM6CHS44UUN5/action/author_attestation","sign_citation":"https://pith.science/pith/HA325EWQGRHSFRRM6CHS44UUN5/action/citation_signature","submit_replication":"https://pith.science/pith/HA325EWQGRHSFRRM6CHS44UUN5/action/replication_record"}},"created_at":"2026-07-05T09:50:54.746600+00:00","updated_at":"2026-07-05T09:50:54.746600+00:00"}