{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:J23UCNBMYWOERNDHVIZ4WSFR7J","short_pith_number":"pith:J23UCNBM","canonical_record":{"source":{"id":"1302.6183","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-02-25T18:29:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7662149cb02525f6626a9b8be29c05ae83ecad518311c4d34548590ba8471437","abstract_canon_sha256":"b02e1465aa5d359faac7cb9b50b0b796bd8fb6c0efb4e270474f39bc2d4eeb10"},"schema_version":"1.0"},"canonical_sha256":"4eb741342cc59c48b467aa33cb48b1fa7e0e6eab84c7ce25bb2b2e5f13e8318d","source":{"kind":"arxiv","id":"1302.6183","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6183","created_at":"2026-05-18T03:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6183v5","created_at":"2026-05-18T03:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6183","created_at":"2026-05-18T03:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"J23UCNBMYWOE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J23UCNBMYWOERNDH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J23UCNBM","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:J23UCNBMYWOERNDHVIZ4WSFR7J","target":"record","payload":{"canonical_record":{"source":{"id":"1302.6183","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-02-25T18:29:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7662149cb02525f6626a9b8be29c05ae83ecad518311c4d34548590ba8471437","abstract_canon_sha256":"b02e1465aa5d359faac7cb9b50b0b796bd8fb6c0efb4e270474f39bc2d4eeb10"},"schema_version":"1.0"},"canonical_sha256":"4eb741342cc59c48b467aa33cb48b1fa7e0e6eab84c7ce25bb2b2e5f13e8318d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:27.002016Z","signature_b64":"13OjhlVcVU2kB3PdB15fIhqdLcDNheaxasTxtyc+a/UwdiO9e9TDnj48Ys36ToZe5Y6uyea0R9dK0ArrgKWIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eb741342cc59c48b467aa33cb48b1fa7e0e6eab84c7ce25bb2b2e5f13e8318d","last_reissued_at":"2026-05-18T03:25:27.001421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:27.001421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.6183","source_version":5,"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-18T03:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v3z0xy0pUSteGL7sDNCLV43U0KezJ3uXONuWWCbA9NSU5QQOPefmIoWgvd2eOxduqZD6iD5cQo8/RSnlRT2XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:06:38.954084Z"},"content_sha256":"01f0035081cab2629f3dfd8ee395d5d5f56c164a93fb0e156394ee5015376b26","schema_version":"1.0","event_id":"sha256:01f0035081cab2629f3dfd8ee395d5d5f56c164a93fb0e156394ee5015376b26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:J23UCNBMYWOERNDHVIZ4WSFR7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Threshold-Coloring and Unit-Cube Contact Representation of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ga\\v{s}per Fijav\\v{z}, Md. Jawaherul Alam, Michael Kaufmann, Sergey Pupyrev, Stephen G. Kobourov, Steven Chaplick","submitted_at":"2013-02-25T18:29:39Z","abstract_excerpt":"In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is present and pairs of vertices with far colors imply the edge is absent. Not all planar graphs are threshold-colorable, but several subclasses, such as trees, some planar grids, and planar graphs without short cycles can always be threshold-colored. Using these results we obtain unit-cube contact representation of several subclasses of planar graphs. Variant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6183","kind":"arxiv","version":5},"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-18T03:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Sjo+TUz4qZpGx0gVPB2NBsmEPM6zU6ZsdCcZYUA6ZHIQb65vLyT2T/EhM8hrP+bxam5g3d9QEtacMQT1lCcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:06:38.954449Z"},"content_sha256":"992e4ee4f9ee89048097df95261cf1f3650f00c9c2e76b1ef30a64ceafb505cd","schema_version":"1.0","event_id":"sha256:992e4ee4f9ee89048097df95261cf1f3650f00c9c2e76b1ef30a64ceafb505cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J23UCNBMYWOERNDHVIZ4WSFR7J/bundle.json","state_url":"https://pith.science/pith/J23UCNBMYWOERNDHVIZ4WSFR7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J23UCNBMYWOERNDHVIZ4WSFR7J/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-31T04:06:38Z","links":{"resolver":"https://pith.science/pith/J23UCNBMYWOERNDHVIZ4WSFR7J","bundle":"https://pith.science/pith/J23UCNBMYWOERNDHVIZ4WSFR7J/bundle.json","state":"https://pith.science/pith/J23UCNBMYWOERNDHVIZ4WSFR7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J23UCNBMYWOERNDHVIZ4WSFR7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:J23UCNBMYWOERNDHVIZ4WSFR7J","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":"b02e1465aa5d359faac7cb9b50b0b796bd8fb6c0efb4e270474f39bc2d4eeb10","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-02-25T18:29:39Z","title_canon_sha256":"7662149cb02525f6626a9b8be29c05ae83ecad518311c4d34548590ba8471437"},"schema_version":"1.0","source":{"id":"1302.6183","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6183","created_at":"2026-05-18T03:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6183v5","created_at":"2026-05-18T03:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6183","created_at":"2026-05-18T03:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"J23UCNBMYWOE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J23UCNBMYWOERNDH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J23UCNBM","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:992e4ee4f9ee89048097df95261cf1f3650f00c9c2e76b1ef30a64ceafb505cd","target":"graph","created_at":"2026-05-18T03:25:27Z","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":"In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is present and pairs of vertices with far colors imply the edge is absent. Not all planar graphs are threshold-colorable, but several subclasses, such as trees, some planar grids, and planar graphs without short cycles can always be threshold-colored. Using these results we obtain unit-cube contact representation of several subclasses of planar graphs. Variant","authors_text":"Ga\\v{s}per Fijav\\v{z}, Md. Jawaherul Alam, Michael Kaufmann, Sergey Pupyrev, Stephen G. Kobourov, Steven Chaplick","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-02-25T18:29:39Z","title":"Threshold-Coloring and Unit-Cube Contact Representation of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6183","kind":"arxiv","version":5},"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:01f0035081cab2629f3dfd8ee395d5d5f56c164a93fb0e156394ee5015376b26","target":"record","created_at":"2026-05-18T03:25:27Z","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":"b02e1465aa5d359faac7cb9b50b0b796bd8fb6c0efb4e270474f39bc2d4eeb10","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-02-25T18:29:39Z","title_canon_sha256":"7662149cb02525f6626a9b8be29c05ae83ecad518311c4d34548590ba8471437"},"schema_version":"1.0","source":{"id":"1302.6183","kind":"arxiv","version":5}},"canonical_sha256":"4eb741342cc59c48b467aa33cb48b1fa7e0e6eab84c7ce25bb2b2e5f13e8318d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4eb741342cc59c48b467aa33cb48b1fa7e0e6eab84c7ce25bb2b2e5f13e8318d","first_computed_at":"2026-05-18T03:25:27.001421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:27.001421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"13OjhlVcVU2kB3PdB15fIhqdLcDNheaxasTxtyc+a/UwdiO9e9TDnj48Ys36ToZe5Y6uyea0R9dK0ArrgKWIAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:27.002016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.6183","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01f0035081cab2629f3dfd8ee395d5d5f56c164a93fb0e156394ee5015376b26","sha256:992e4ee4f9ee89048097df95261cf1f3650f00c9c2e76b1ef30a64ceafb505cd"],"state_sha256":"b23e7c8cfd01a02b2204e5dd2e89141df0536a2006ddf927a03a8b4bf2a5e992"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/MdYGFSvKdq383sPiPGiBuda2Or2oxf9qcHfJ61lnM1dGboX/ts9q5C1t0C1Z6pXMn73qjRdZIH5BvWy0aPWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:06:38.956533Z","bundle_sha256":"ffd4a9be2b515bbe5e278ed74dde13181ee7aab7fb872749a07293de9753797d"}}