{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5R5FX7J37C2XJN6C4VIZIR4TNV","short_pith_number":"pith:5R5FX7J3","canonical_record":{"source":{"id":"1510.05524","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2015-10-19T15:15:18Z","cross_cats_sorted":[],"title_canon_sha256":"58b509c0d4f50bca52d7e9fd248e37ce4f072b501a9b6207f034179fbecabf09","abstract_canon_sha256":"957c2a81f4f2df27dba8cb0bbb2939d124ddc97971cf27eaa9474b80741163b7"},"schema_version":"1.0"},"canonical_sha256":"ec7a5bfd3bf8b574b7c2e5519447936d5d28c02be85e01533434f5da54d6aaf0","source":{"kind":"arxiv","id":"1510.05524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05524","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05524v1","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05524","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"5R5FX7J37C2X","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5R5FX7J37C2XJN6C","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5R5FX7J3","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5R5FX7J37C2XJN6C4VIZIR4TNV","target":"record","payload":{"canonical_record":{"source":{"id":"1510.05524","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2015-10-19T15:15:18Z","cross_cats_sorted":[],"title_canon_sha256":"58b509c0d4f50bca52d7e9fd248e37ce4f072b501a9b6207f034179fbecabf09","abstract_canon_sha256":"957c2a81f4f2df27dba8cb0bbb2939d124ddc97971cf27eaa9474b80741163b7"},"schema_version":"1.0"},"canonical_sha256":"ec7a5bfd3bf8b574b7c2e5519447936d5d28c02be85e01533434f5da54d6aaf0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:52.118646Z","signature_b64":"gYgvS5PhTVhLfDP3WxSMxvjCXScs5qFa2PioC4qOYMroRGPpq6ep6wyDyeDpM3gfP4Y3ZjCV2rL/BW00WSB9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec7a5bfd3bf8b574b7c2e5519447936d5d28c02be85e01533434f5da54d6aaf0","last_reissued_at":"2026-05-18T01:29:52.118049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:52.118049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.05524","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jYlB77MP1ODiqoT/n2V9ilkD7KH5cEDdbeS7/rRbF7CyaDAfnFSyYTkV6IvI3VZZzQm9y7WQajr/ISt34/kBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:22:33.582750Z"},"content_sha256":"1758d001d1c2bf3ae7f3fa7b9ea91c014e3faca735920d04550a7793727eb92a","schema_version":"1.0","event_id":"sha256:1758d001d1c2bf3ae7f3fa7b9ea91c014e3faca735920d04550a7793727eb92a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5R5FX7J37C2XJN6C4VIZIR4TNV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Packing Chromatic Number on Hamming Graphs and General Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Daniel Severin, Graciela Nasini, Pablo Torres","submitted_at":"2015-10-19T15:15:18Z","abstract_excerpt":"The packing chromatic number $\\chi_\\rho(G)$ of a graph $G$ is the smallest integer $k$ needed to proper color the vertices of $G$ in such a way the distance between any two vertices having color $i$ be at least $i+1$. We obtain $\\chi_\\rho(H_{q,m})$ for $m=3$, where $H_{q,m}$ is the Hamming graph of words of length $m$ and alphabet with $q$ symbols, and tabulate bounds of them for $m \\geq 4$ up to 10000 vertices. We also give a polynomial reduction from the problem of finding $\\chi_\\rho(G)$ to the Maximum Stable Set problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05524","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AB0OrUPeq9Llty67M0aiYds1Kxty2s7ovf/zQ4omlnycyaSam/7oJZ5vbAHpHf/77vaZ6A6QWcQxh/b0m8WVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:22:33.583137Z"},"content_sha256":"413e96315088897c092314d8735cbaf5b0f6fb5c29806b3668a8d1f896e5ce58","schema_version":"1.0","event_id":"sha256:413e96315088897c092314d8735cbaf5b0f6fb5c29806b3668a8d1f896e5ce58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5R5FX7J37C2XJN6C4VIZIR4TNV/bundle.json","state_url":"https://pith.science/pith/5R5FX7J37C2XJN6C4VIZIR4TNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5R5FX7J37C2XJN6C4VIZIR4TNV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T03:22:33Z","links":{"resolver":"https://pith.science/pith/5R5FX7J37C2XJN6C4VIZIR4TNV","bundle":"https://pith.science/pith/5R5FX7J37C2XJN6C4VIZIR4TNV/bundle.json","state":"https://pith.science/pith/5R5FX7J37C2XJN6C4VIZIR4TNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5R5FX7J37C2XJN6C4VIZIR4TNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5R5FX7J37C2XJN6C4VIZIR4TNV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"957c2a81f4f2df27dba8cb0bbb2939d124ddc97971cf27eaa9474b80741163b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2015-10-19T15:15:18Z","title_canon_sha256":"58b509c0d4f50bca52d7e9fd248e37ce4f072b501a9b6207f034179fbecabf09"},"schema_version":"1.0","source":{"id":"1510.05524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05524","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05524v1","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05524","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"5R5FX7J37C2X","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5R5FX7J37C2XJN6C","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5R5FX7J3","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:413e96315088897c092314d8735cbaf5b0f6fb5c29806b3668a8d1f896e5ce58","target":"graph","created_at":"2026-05-18T01:29:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The packing chromatic number $\\chi_\\rho(G)$ of a graph $G$ is the smallest integer $k$ needed to proper color the vertices of $G$ in such a way the distance between any two vertices having color $i$ be at least $i+1$. We obtain $\\chi_\\rho(H_{q,m})$ for $m=3$, where $H_{q,m}$ is the Hamming graph of words of length $m$ and alphabet with $q$ symbols, and tabulate bounds of them for $m \\geq 4$ up to 10000 vertices. We also give a polynomial reduction from the problem of finding $\\chi_\\rho(G)$ to the Maximum Stable Set problem.","authors_text":"Daniel Severin, Graciela Nasini, Pablo Torres","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2015-10-19T15:15:18Z","title":"On the Packing Chromatic Number on Hamming Graphs and General Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05524","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1758d001d1c2bf3ae7f3fa7b9ea91c014e3faca735920d04550a7793727eb92a","target":"record","created_at":"2026-05-18T01:29:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"957c2a81f4f2df27dba8cb0bbb2939d124ddc97971cf27eaa9474b80741163b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2015-10-19T15:15:18Z","title_canon_sha256":"58b509c0d4f50bca52d7e9fd248e37ce4f072b501a9b6207f034179fbecabf09"},"schema_version":"1.0","source":{"id":"1510.05524","kind":"arxiv","version":1}},"canonical_sha256":"ec7a5bfd3bf8b574b7c2e5519447936d5d28c02be85e01533434f5da54d6aaf0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec7a5bfd3bf8b574b7c2e5519447936d5d28c02be85e01533434f5da54d6aaf0","first_computed_at":"2026-05-18T01:29:52.118049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:52.118049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gYgvS5PhTVhLfDP3WxSMxvjCXScs5qFa2PioC4qOYMroRGPpq6ep6wyDyeDpM3gfP4Y3ZjCV2rL/BW00WSB9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:52.118646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1758d001d1c2bf3ae7f3fa7b9ea91c014e3faca735920d04550a7793727eb92a","sha256:413e96315088897c092314d8735cbaf5b0f6fb5c29806b3668a8d1f896e5ce58"],"state_sha256":"cda80f8bf9c913943893fe621846f5e978906b200c9c9f4166c199a2b31ef263"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vTrb/UoX/sZHRPdrTzCYI/8ILkYHpC+KeBYBPIfevNqN2eb9MdRHkZsqyJibMMG5oblABFDUl6wVNDXm1H3uBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:22:33.585252Z","bundle_sha256":"ef3b46445add781a5e0bc36deaaee90eea67fb661475eef44dd48d282d62c8c3"}}