{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FVTGJR46MJFGBZ5UHA5OBTJS57","short_pith_number":"pith:FVTGJR46","schema_version":"1.0","canonical_sha256":"2d6664c79e624a60e7b4383ae0cd32eff883d916748be366776d8c18afa54fab","source":{"kind":"arxiv","id":"1505.07781","version":1},"attestation_state":"computed","paper":{"title":"Subdivision into i-packings and S-packing chromatic number of some lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hamamache Kheddouci (LIRIS), Nicolas Gastineau (Le2i), Olivier Togni (Le2i)","submitted_at":"2015-05-28T18:06:44Z","abstract_excerpt":"An $i$-packing in a graph $G$ is a set of vertices at pairwise distance greater than $i$. For a nondecreasing sequence of integers $S=(s\\_{1},s\\_{2},\\ldots)$, the $S$-packing chromatic number of a graph $G$ is the least integer $k$ such that there exists a coloring of $G$ into $k$ colors where each set of vertices colored $i$, $i=1,\\ldots, k$, is an $s\\_i$-packing.\nThis paper describes various subdivisions of an $i$-packing into $j$-packings ($j\\textgreater{}i$) for the hexagonal, square and triangular lattices. These results allow us to bound the $S$-packing chromatic number for these graphs,"},"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":"1505.07781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-28T18:06:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"af27141fd5e03c7283e7ff61e7b11429181d0a3158bab7ad5b517a151643ff8e","abstract_canon_sha256":"5b67c88b6b8493257b2f53a4d25cc06dbcca99df774b8351b536ad36d4b77a9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:55.872883Z","signature_b64":"0gKEduTyIPr2xWJhznVpbjhEKKE7XPJHolGni287yK7uBLX0zo6aLduWP4eW5tic/Cpx+KFg+R9QmH6R8ui8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d6664c79e624a60e7b4383ae0cd32eff883d916748be366776d8c18afa54fab","last_reissued_at":"2026-05-18T02:00:55.872310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:55.872310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subdivision into i-packings and S-packing chromatic number of some lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hamamache Kheddouci (LIRIS), Nicolas Gastineau (Le2i), Olivier Togni (Le2i)","submitted_at":"2015-05-28T18:06:44Z","abstract_excerpt":"An $i$-packing in a graph $G$ is a set of vertices at pairwise distance greater than $i$. For a nondecreasing sequence of integers $S=(s\\_{1},s\\_{2},\\ldots)$, the $S$-packing chromatic number of a graph $G$ is the least integer $k$ such that there exists a coloring of $G$ into $k$ colors where each set of vertices colored $i$, $i=1,\\ldots, k$, is an $s\\_i$-packing.\nThis paper describes various subdivisions of an $i$-packing into $j$-packings ($j\\textgreater{}i$) for the hexagonal, square and triangular lattices. These results allow us to bound the $S$-packing chromatic number for these graphs,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07781","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":"1505.07781","created_at":"2026-05-18T02:00:55.872406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07781v1","created_at":"2026-05-18T02:00:55.872406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07781","created_at":"2026-05-18T02:00:55.872406+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVTGJR46MJFG","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVTGJR46MJFGBZ5U","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVTGJR46","created_at":"2026-05-18T12:29:22.688609+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/FVTGJR46MJFGBZ5UHA5OBTJS57","json":"https://pith.science/pith/FVTGJR46MJFGBZ5UHA5OBTJS57.json","graph_json":"https://pith.science/api/pith-number/FVTGJR46MJFGBZ5UHA5OBTJS57/graph.json","events_json":"https://pith.science/api/pith-number/FVTGJR46MJFGBZ5UHA5OBTJS57/events.json","paper":"https://pith.science/paper/FVTGJR46"},"agent_actions":{"view_html":"https://pith.science/pith/FVTGJR46MJFGBZ5UHA5OBTJS57","download_json":"https://pith.science/pith/FVTGJR46MJFGBZ5UHA5OBTJS57.json","view_paper":"https://pith.science/paper/FVTGJR46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07781&json=true","fetch_graph":"https://pith.science/api/pith-number/FVTGJR46MJFGBZ5UHA5OBTJS57/graph.json","fetch_events":"https://pith.science/api/pith-number/FVTGJR46MJFGBZ5UHA5OBTJS57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVTGJR46MJFGBZ5UHA5OBTJS57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVTGJR46MJFGBZ5UHA5OBTJS57/action/storage_attestation","attest_author":"https://pith.science/pith/FVTGJR46MJFGBZ5UHA5OBTJS57/action/author_attestation","sign_citation":"https://pith.science/pith/FVTGJR46MJFGBZ5UHA5OBTJS57/action/citation_signature","submit_replication":"https://pith.science/pith/FVTGJR46MJFGBZ5UHA5OBTJS57/action/replication_record"}},"created_at":"2026-05-18T02:00:55.872406+00:00","updated_at":"2026-05-18T02:00:55.872406+00:00"}