{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7XMJP4VNV4ZQHKWMMTTY2QEKIJ","short_pith_number":"pith:7XMJP4VN","canonical_record":{"source":{"id":"1406.0482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-02T19:23:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c4c8813ac6c4575ac5b43b1be0a48666950c22d22767eecc950f6eaaf8e33235","abstract_canon_sha256":"c4feeb391aee13ce8d64eb9cf1c18d32cf3e9c025b56d9d1df1b751b6d6c1e82"},"schema_version":"1.0"},"canonical_sha256":"fdd897f2adaf3303aacc64e78d408a427140dc5cd34aa74a4d569bcb8163baed","source":{"kind":"arxiv","id":"1406.0482","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0482","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0482v2","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0482","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"7XMJP4VNV4ZQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7XMJP4VNV4ZQHKWM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7XMJP4VN","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7XMJP4VNV4ZQHKWMMTTY2QEKIJ","target":"record","payload":{"canonical_record":{"source":{"id":"1406.0482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-02T19:23:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c4c8813ac6c4575ac5b43b1be0a48666950c22d22767eecc950f6eaaf8e33235","abstract_canon_sha256":"c4feeb391aee13ce8d64eb9cf1c18d32cf3e9c025b56d9d1df1b751b6d6c1e82"},"schema_version":"1.0"},"canonical_sha256":"fdd897f2adaf3303aacc64e78d408a427140dc5cd34aa74a4d569bcb8163baed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:53.355122Z","signature_b64":"GmANZtMWyMDQvuEeqbk0tWDP5YbyRCaeJwprVM5/TrUGxA4JbL/9UBK0aXqCM1nXsLApc+pVjNinpLEVZJb2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdd897f2adaf3303aacc64e78d408a427140dc5cd34aa74a4d569bcb8163baed","last_reissued_at":"2026-05-18T02:49:53.354591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:53.354591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.0482","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-05-18T02:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a9yzhLefH60d5Km6RfHNNU35oEJrRv6miIxQxmfp+lNUAvnxsMrZ9izCtZcPGxqaWU3H/ZUAqn4A+bT7pifJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:35:23.462740Z"},"content_sha256":"2462c616b29e39e4a29190f8d207455ae78b12cde201eb3dceacd9ca56a629bf","schema_version":"1.0","event_id":"sha256:2462c616b29e39e4a29190f8d207455ae78b12cde201eb3dceacd9ca56a629bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7XMJP4VNV4ZQHKWMMTTY2QEKIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds for the Zero-Forcing Number of Graphs with Large Girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Franklin Kenter, Randy Davila","submitted_at":"2014-06-02T19:23:43Z","abstract_excerpt":"We investigate the zero-forcing number for triangle-free graphs. We improve upon the trivial bound, $\\delta \\le Z(G)$ where $\\delta$ is the minimum degree, in the triangle-free case. In particular, we show that $2 \\delta - 2 \\le Z(G)$ for graphs with girth of at least 5, and this can be further improved when $G$ has a small cut set. Using these results, we are able to prove the Graph Complement Conjecture on minimum rank for a large class of graphs. Lastly, we make a conjecture that the lower bound for $Z(G)$ increases as a function of the girth, $g$, and $\\delta$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0482","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":""},"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-18T02:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFoU/Xvl7JsJpJ1h/08k14z0XjnGXJpMCSiSAaLNe6RCCBJlXlFTGPYO1p1cdv4aHSCuV+RCFREtOttqjEzFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:35:23.463160Z"},"content_sha256":"cabd147b7c3512f1892aab879ed61e9998737d3c90a846eaaaed59632dd13088","schema_version":"1.0","event_id":"sha256:cabd147b7c3512f1892aab879ed61e9998737d3c90a846eaaaed59632dd13088"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/bundle.json","state_url":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/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-27T16:35:23Z","links":{"resolver":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ","bundle":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/bundle.json","state":"https://pith.science/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XMJP4VNV4ZQHKWMMTTY2QEKIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7XMJP4VNV4ZQHKWMMTTY2QEKIJ","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":"c4feeb391aee13ce8d64eb9cf1c18d32cf3e9c025b56d9d1df1b751b6d6c1e82","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-02T19:23:43Z","title_canon_sha256":"c4c8813ac6c4575ac5b43b1be0a48666950c22d22767eecc950f6eaaf8e33235"},"schema_version":"1.0","source":{"id":"1406.0482","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0482","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0482v2","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0482","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"7XMJP4VNV4ZQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7XMJP4VNV4ZQHKWM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7XMJP4VN","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:cabd147b7c3512f1892aab879ed61e9998737d3c90a846eaaaed59632dd13088","target":"graph","created_at":"2026-05-18T02:49:53Z","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":"We investigate the zero-forcing number for triangle-free graphs. We improve upon the trivial bound, $\\delta \\le Z(G)$ where $\\delta$ is the minimum degree, in the triangle-free case. In particular, we show that $2 \\delta - 2 \\le Z(G)$ for graphs with girth of at least 5, and this can be further improved when $G$ has a small cut set. Using these results, we are able to prove the Graph Complement Conjecture on minimum rank for a large class of graphs. Lastly, we make a conjecture that the lower bound for $Z(G)$ increases as a function of the girth, $g$, and $\\delta$.","authors_text":"Franklin Kenter, Randy Davila","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-02T19:23:43Z","title":"Bounds for the Zero-Forcing Number of Graphs with Large Girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0482","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:2462c616b29e39e4a29190f8d207455ae78b12cde201eb3dceacd9ca56a629bf","target":"record","created_at":"2026-05-18T02:49:53Z","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":"c4feeb391aee13ce8d64eb9cf1c18d32cf3e9c025b56d9d1df1b751b6d6c1e82","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-02T19:23:43Z","title_canon_sha256":"c4c8813ac6c4575ac5b43b1be0a48666950c22d22767eecc950f6eaaf8e33235"},"schema_version":"1.0","source":{"id":"1406.0482","kind":"arxiv","version":2}},"canonical_sha256":"fdd897f2adaf3303aacc64e78d408a427140dc5cd34aa74a4d569bcb8163baed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdd897f2adaf3303aacc64e78d408a427140dc5cd34aa74a4d569bcb8163baed","first_computed_at":"2026-05-18T02:49:53.354591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:53.354591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GmANZtMWyMDQvuEeqbk0tWDP5YbyRCaeJwprVM5/TrUGxA4JbL/9UBK0aXqCM1nXsLApc+pVjNinpLEVZJb2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:53.355122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0482","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2462c616b29e39e4a29190f8d207455ae78b12cde201eb3dceacd9ca56a629bf","sha256:cabd147b7c3512f1892aab879ed61e9998737d3c90a846eaaaed59632dd13088"],"state_sha256":"49a843edb0476eb5788aaac6606d14f4f598e74591c8ce5bbbb0b1e541c3782f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DmAcAr6cLrcFgydbzb2aRuZQ7kIJattwDx5FoI2QieY6uNC2/DCHT7kRBtHH9oxr6/q5aVIGUKR2NiZ+gwxJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:35:23.466287Z","bundle_sha256":"f7c14b3f5fba8960d9365dc971af16774bf6a5bb1a57cc738eb25110687559f8"}}