{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LHQU6PDSJJ45VT4RZCP2WWHK7N","short_pith_number":"pith:LHQU6PDS","schema_version":"1.0","canonical_sha256":"59e14f3c724a79dacf91c89fab58eafb7d27e3730a9e114abbb5da483cbd9256","source":{"kind":"arxiv","id":"1809.09565","version":1},"attestation_state":"computed","paper":{"title":"Girth, minimum degree, independence, and broadcast independence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, St\\'ephane Bessy","submitted_at":"2018-09-25T15:59:33Z","abstract_excerpt":"An independent broadcast on a connected graph $G$ is a function $f:V(G)\\to \\mathbb{N}_0$ such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$, and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$. The broadcast independence number $\\alpha_b(G)$ of $G$ is the largest weight $\\sum\\limits_{x\\in V(G)}f(x)$ of an independent broadcast $f$ on $G$.\n  It is known that $\\alpha(G)\\leq \\alpha_b(G)\\leq 4\\alpha(G)$ for every connected graph $G$, where $\\alpha(G)$ is the independence number of $G$. If $G$ has gir"},"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":"1809.09565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-25T15:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"a94132d36e04b47cc822840b6459c4dfc9801491620cca1ca3df82a15212aac7","abstract_canon_sha256":"93e387ce1c0f024896a602324c3bd503e1543cad80262b5b101d0f3a1159577a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:50.750861Z","signature_b64":"YpFhwfpoqWaHvXXt4Kaqpratj5R0A5aWddugdZw+Gz+tRnU8LhnO7m5FOamT0IkXxEFpuGT+5vDF9g9mujwgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59e14f3c724a79dacf91c89fab58eafb7d27e3730a9e114abbb5da483cbd9256","last_reissued_at":"2026-05-18T00:04:50.750132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:50.750132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Girth, minimum degree, independence, and broadcast independence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, St\\'ephane Bessy","submitted_at":"2018-09-25T15:59:33Z","abstract_excerpt":"An independent broadcast on a connected graph $G$ is a function $f:V(G)\\to \\mathbb{N}_0$ such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$, and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$. The broadcast independence number $\\alpha_b(G)$ of $G$ is the largest weight $\\sum\\limits_{x\\in V(G)}f(x)$ of an independent broadcast $f$ on $G$.\n  It is known that $\\alpha(G)\\leq \\alpha_b(G)\\leq 4\\alpha(G)$ for every connected graph $G$, where $\\alpha(G)$ is the independence number of $G$. If $G$ has gir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09565","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.09565","created_at":"2026-05-18T00:04:50.750243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09565v1","created_at":"2026-05-18T00:04:50.750243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09565","created_at":"2026-05-18T00:04:50.750243+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHQU6PDSJJ45","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHQU6PDSJJ45VT4R","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHQU6PDS","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16001","citing_title":"On the parameterized complexity of Broadcast Independence and Broadcast Packing","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LHQU6PDSJJ45VT4RZCP2WWHK7N","json":"https://pith.science/pith/LHQU6PDSJJ45VT4RZCP2WWHK7N.json","graph_json":"https://pith.science/api/pith-number/LHQU6PDSJJ45VT4RZCP2WWHK7N/graph.json","events_json":"https://pith.science/api/pith-number/LHQU6PDSJJ45VT4RZCP2WWHK7N/events.json","paper":"https://pith.science/paper/LHQU6PDS"},"agent_actions":{"view_html":"https://pith.science/pith/LHQU6PDSJJ45VT4RZCP2WWHK7N","download_json":"https://pith.science/pith/LHQU6PDSJJ45VT4RZCP2WWHK7N.json","view_paper":"https://pith.science/paper/LHQU6PDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09565&json=true","fetch_graph":"https://pith.science/api/pith-number/LHQU6PDSJJ45VT4RZCP2WWHK7N/graph.json","fetch_events":"https://pith.science/api/pith-number/LHQU6PDSJJ45VT4RZCP2WWHK7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHQU6PDSJJ45VT4RZCP2WWHK7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHQU6PDSJJ45VT4RZCP2WWHK7N/action/storage_attestation","attest_author":"https://pith.science/pith/LHQU6PDSJJ45VT4RZCP2WWHK7N/action/author_attestation","sign_citation":"https://pith.science/pith/LHQU6PDSJJ45VT4RZCP2WWHK7N/action/citation_signature","submit_replication":"https://pith.science/pith/LHQU6PDSJJ45VT4RZCP2WWHK7N/action/replication_record"}},"created_at":"2026-05-18T00:04:50.750243+00:00","updated_at":"2026-05-18T00:04:50.750243+00:00"}