{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GEZD5RY5B4W624NY533MSBLYMU","short_pith_number":"pith:GEZD5RY5","schema_version":"1.0","canonical_sha256":"31323ec71d0f2ded71b8eef6c90578653993cf956e5d10dad7bfaf884b80caf1","source":{"kind":"arxiv","id":"1811.04449","version":2},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Graph Burning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Shahin Kamali","submitted_at":"2018-11-11T18:58:48Z","abstract_excerpt":"Numerous approaches study the vulnerability of networks against social contagion. Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The burning process takes place in synchronous, discrete rounds. In each round, a fire breaks out at a vertex, and the fire spreads to all vertices that are adjacent to a burning vertex. The selection of vertices where fires start defines a schedule that indicates the number of rounds required to burn all vertices. Given a graph, the objective of an algorithm is to find a schedule that minimizes the number of rounds to burn"},"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":"1811.04449","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2018-11-11T18:58:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"29e3f011a05371c117659f8367db1ac44f06f0863ad50e0b161c74da5adb8f24","abstract_canon_sha256":"a2ba63d44d54fc5d7ed0f976624a8c98221f4458eb23a0eed3146a61681d95cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:22.145588Z","signature_b64":"gzpWlHBacbR/kcAf75e9qG6nNHntqFrn0MIoTcJAnZEeTzCqbHXwgNYE8bsImumou0DXsb91XvImvAL/Vwr4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31323ec71d0f2ded71b8eef6c90578653993cf956e5d10dad7bfaf884b80caf1","last_reissued_at":"2026-05-17T23:49:22.144950Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:22.144950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Graph Burning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Shahin Kamali","submitted_at":"2018-11-11T18:58:48Z","abstract_excerpt":"Numerous approaches study the vulnerability of networks against social contagion. Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The burning process takes place in synchronous, discrete rounds. In each round, a fire breaks out at a vertex, and the fire spreads to all vertices that are adjacent to a burning vertex. The selection of vertices where fires start defines a schedule that indicates the number of rounds required to burn all vertices. Given a graph, the objective of an algorithm is to find a schedule that minimizes the number of rounds to burn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04449","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":"1811.04449","created_at":"2026-05-17T23:49:22.145051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.04449v2","created_at":"2026-05-17T23:49:22.145051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04449","created_at":"2026-05-17T23:49:22.145051+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEZD5RY5B4W6","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEZD5RY5B4W624NY","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEZD5RY5","created_at":"2026-05-18T12:32:25.280505+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/GEZD5RY5B4W624NY533MSBLYMU","json":"https://pith.science/pith/GEZD5RY5B4W624NY533MSBLYMU.json","graph_json":"https://pith.science/api/pith-number/GEZD5RY5B4W624NY533MSBLYMU/graph.json","events_json":"https://pith.science/api/pith-number/GEZD5RY5B4W624NY533MSBLYMU/events.json","paper":"https://pith.science/paper/GEZD5RY5"},"agent_actions":{"view_html":"https://pith.science/pith/GEZD5RY5B4W624NY533MSBLYMU","download_json":"https://pith.science/pith/GEZD5RY5B4W624NY533MSBLYMU.json","view_paper":"https://pith.science/paper/GEZD5RY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.04449&json=true","fetch_graph":"https://pith.science/api/pith-number/GEZD5RY5B4W624NY533MSBLYMU/graph.json","fetch_events":"https://pith.science/api/pith-number/GEZD5RY5B4W624NY533MSBLYMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEZD5RY5B4W624NY533MSBLYMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEZD5RY5B4W624NY533MSBLYMU/action/storage_attestation","attest_author":"https://pith.science/pith/GEZD5RY5B4W624NY533MSBLYMU/action/author_attestation","sign_citation":"https://pith.science/pith/GEZD5RY5B4W624NY533MSBLYMU/action/citation_signature","submit_replication":"https://pith.science/pith/GEZD5RY5B4W624NY533MSBLYMU/action/replication_record"}},"created_at":"2026-05-17T23:49:22.145051+00:00","updated_at":"2026-05-17T23:49:22.145051+00:00"}