{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C7GN5FP33733UZ34TNTLPN7JKG","short_pith_number":"pith:C7GN5FP3","schema_version":"1.0","canonical_sha256":"17ccde95fbdff7ba677c9b66b7b7e951898d70dc8c344f931e8d431ec43cd03c","source":{"kind":"arxiv","id":"1705.03442","version":2},"attestation_state":"computed","paper":{"title":"The Interactive Sum Choice Number of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo","submitted_at":"2017-05-09T17:35:30Z","abstract_excerpt":"We study the interactive sum choice number, a game coloring parameter introduced by Bonamy and Meeks, and obtain a recursive formula for the interactive sum choice number of forests. This formula coincides with a formula for the slow coloring cost of forests, a parameter introduced by Mahoney, Puleo, and West, and shows that these parameters are equal on forests. This answers a question of Bonamy and Meeks."},"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":"1705.03442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-09T17:35:30Z","cross_cats_sorted":[],"title_canon_sha256":"71839ef89a69fa106fe7e5a9047ddb1458fd234cdf5314979fc242b568d39b84","abstract_canon_sha256":"dc6f7da7a4951deb21076f9bb8a3f47be9306081b666de823cfb6b72182fec19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:49.915672Z","signature_b64":"jzl3gFaQeR2EYy+8+d06iiZ9riWATw9YMEKv9L21QXbYan6IJ5nMqJU/36GPro397uOu0RWGl3cq58v4HTOBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17ccde95fbdff7ba677c9b66b7b7e951898d70dc8c344f931e8d431ec43cd03c","last_reissued_at":"2026-05-18T00:33:49.915157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:49.915157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Interactive Sum Choice Number of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo","submitted_at":"2017-05-09T17:35:30Z","abstract_excerpt":"We study the interactive sum choice number, a game coloring parameter introduced by Bonamy and Meeks, and obtain a recursive formula for the interactive sum choice number of forests. This formula coincides with a formula for the slow coloring cost of forests, a parameter introduced by Mahoney, Puleo, and West, and shows that these parameters are equal on forests. This answers a question of Bonamy and Meeks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03442","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":"1705.03442","created_at":"2026-05-18T00:33:49.915246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03442v2","created_at":"2026-05-18T00:33:49.915246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03442","created_at":"2026-05-18T00:33:49.915246+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7GN5FP33733","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7GN5FP33733UZ34","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7GN5FP3","created_at":"2026-05-18T12:31:10.602751+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/C7GN5FP33733UZ34TNTLPN7JKG","json":"https://pith.science/pith/C7GN5FP33733UZ34TNTLPN7JKG.json","graph_json":"https://pith.science/api/pith-number/C7GN5FP33733UZ34TNTLPN7JKG/graph.json","events_json":"https://pith.science/api/pith-number/C7GN5FP33733UZ34TNTLPN7JKG/events.json","paper":"https://pith.science/paper/C7GN5FP3"},"agent_actions":{"view_html":"https://pith.science/pith/C7GN5FP33733UZ34TNTLPN7JKG","download_json":"https://pith.science/pith/C7GN5FP33733UZ34TNTLPN7JKG.json","view_paper":"https://pith.science/paper/C7GN5FP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03442&json=true","fetch_graph":"https://pith.science/api/pith-number/C7GN5FP33733UZ34TNTLPN7JKG/graph.json","fetch_events":"https://pith.science/api/pith-number/C7GN5FP33733UZ34TNTLPN7JKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7GN5FP33733UZ34TNTLPN7JKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7GN5FP33733UZ34TNTLPN7JKG/action/storage_attestation","attest_author":"https://pith.science/pith/C7GN5FP33733UZ34TNTLPN7JKG/action/author_attestation","sign_citation":"https://pith.science/pith/C7GN5FP33733UZ34TNTLPN7JKG/action/citation_signature","submit_replication":"https://pith.science/pith/C7GN5FP33733UZ34TNTLPN7JKG/action/replication_record"}},"created_at":"2026-05-18T00:33:49.915246+00:00","updated_at":"2026-05-18T00:33:49.915246+00:00"}