{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XXPFQKLYBL746KUH4SOCC4W3HO","short_pith_number":"pith:XXPFQKLY","schema_version":"1.0","canonical_sha256":"bdde5829780affcf2a87e49c2172db3b837352d911456f725060a8c2a8674157","source":{"kind":"arxiv","id":"1612.08283","version":2},"attestation_state":"computed","paper":{"title":"On the Broadcast Independence Number of Caterpillars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eric Sopena (LaBRI), Isma Bouchemakh (L'IFORCE), Messaouda Ahmane (L'IFORCE)","submitted_at":"2016-12-25T18:02:48Z","abstract_excerpt":"Let $G$ be a simple undirected graph.A broadcast on $G$ isa function $f : V(G)\\rightarrow\\mathbb{N}$ such that $f(v)\\le e\\_G(v)$ holds for every vertex $v$ of $G$, where $e\\_G(v)$ denotes the eccentricity of $v$ in $G$, that is, the maximum distance from $v$ to any other vertex of $G$.The cost of $f$ is the value ${\\rm cost}(f)=\\sum\\_{v\\in V(G)}f(v)$.A broadcast $f$ on $G$ is independent if for every two distinct vertices $u$ and $v$ in $G$, $d\\_G(u,v)>\\max\\{f(u),f(v)\\}$,where $d\\_G(u,v)$ denotes the distance between $u$ and $v$ in $G$.The broadcast independence number of $G$ is then defined a"},"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":"1612.08283","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-12-25T18:02:48Z","cross_cats_sorted":[],"title_canon_sha256":"af52a11a3e2ea5400189b7709bf62d45beff6b9188d7485ec86dc3bd4554440a","abstract_canon_sha256":"5607d390758a13b32160d6d017751ad665ae7b2b7c3a755a1c2d34572f4992a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:01.508253Z","signature_b64":"R+V4XdLSzs+xs1GehriKYd+P312mASROXlcSWhZgWOIWUiUHxT2SLZFxTep6x/NNA5sRrg3tWJAyHhahHg7UAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdde5829780affcf2a87e49c2172db3b837352d911456f725060a8c2a8674157","last_reissued_at":"2026-05-18T00:26:01.507509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:01.507509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Broadcast Independence Number of Caterpillars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eric Sopena (LaBRI), Isma Bouchemakh (L'IFORCE), Messaouda Ahmane (L'IFORCE)","submitted_at":"2016-12-25T18:02:48Z","abstract_excerpt":"Let $G$ be a simple undirected graph.A broadcast on $G$ isa function $f : V(G)\\rightarrow\\mathbb{N}$ such that $f(v)\\le e\\_G(v)$ holds for every vertex $v$ of $G$, where $e\\_G(v)$ denotes the eccentricity of $v$ in $G$, that is, the maximum distance from $v$ to any other vertex of $G$.The cost of $f$ is the value ${\\rm cost}(f)=\\sum\\_{v\\in V(G)}f(v)$.A broadcast $f$ on $G$ is independent if for every two distinct vertices $u$ and $v$ in $G$, $d\\_G(u,v)>\\max\\{f(u),f(v)\\}$,where $d\\_G(u,v)$ denotes the distance between $u$ and $v$ in $G$.The broadcast independence number of $G$ is then defined a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08283","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.08283","created_at":"2026-05-18T00:26:01.507641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.08283v2","created_at":"2026-05-18T00:26:01.507641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08283","created_at":"2026-05-18T00:26:01.507641+00:00"},{"alias_kind":"pith_short_12","alias_value":"XXPFQKLYBL74","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XXPFQKLYBL746KUH","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XXPFQKLY","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XXPFQKLYBL746KUH4SOCC4W3HO","json":"https://pith.science/pith/XXPFQKLYBL746KUH4SOCC4W3HO.json","graph_json":"https://pith.science/api/pith-number/XXPFQKLYBL746KUH4SOCC4W3HO/graph.json","events_json":"https://pith.science/api/pith-number/XXPFQKLYBL746KUH4SOCC4W3HO/events.json","paper":"https://pith.science/paper/XXPFQKLY"},"agent_actions":{"view_html":"https://pith.science/pith/XXPFQKLYBL746KUH4SOCC4W3HO","download_json":"https://pith.science/pith/XXPFQKLYBL746KUH4SOCC4W3HO.json","view_paper":"https://pith.science/paper/XXPFQKLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.08283&json=true","fetch_graph":"https://pith.science/api/pith-number/XXPFQKLYBL746KUH4SOCC4W3HO/graph.json","fetch_events":"https://pith.science/api/pith-number/XXPFQKLYBL746KUH4SOCC4W3HO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XXPFQKLYBL746KUH4SOCC4W3HO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XXPFQKLYBL746KUH4SOCC4W3HO/action/storage_attestation","attest_author":"https://pith.science/pith/XXPFQKLYBL746KUH4SOCC4W3HO/action/author_attestation","sign_citation":"https://pith.science/pith/XXPFQKLYBL746KUH4SOCC4W3HO/action/citation_signature","submit_replication":"https://pith.science/pith/XXPFQKLYBL746KUH4SOCC4W3HO/action/replication_record"}},"created_at":"2026-05-18T00:26:01.507641+00:00","updated_at":"2026-05-18T00:26:01.507641+00:00"}