{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:L2E5JWPNMSLLPWCUDNDH4QRVXC","short_pith_number":"pith:L2E5JWPN","canonical_record":{"source":{"id":"1404.0588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-02T15:34:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9341ae7382db1de6fbcd678f59e09f955c0680e4bf573d72966e3a2c2541f0e5","abstract_canon_sha256":"525f2c62703e2cd108068bc29daacb00cc438c3318d6a0b4d628352f9b1d9194"},"schema_version":"1.0"},"canonical_sha256":"5e89d4d9ed6496b7d8541b467e4235b8bd4878add639a08d90d126f0fd2343dd","source":{"kind":"arxiv","id":"1404.0588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0588","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0588v1","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0588","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"L2E5JWPNMSLL","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L2E5JWPNMSLLPWCU","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L2E5JWPN","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:L2E5JWPNMSLLPWCUDNDH4QRVXC","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-02T15:34:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9341ae7382db1de6fbcd678f59e09f955c0680e4bf573d72966e3a2c2541f0e5","abstract_canon_sha256":"525f2c62703e2cd108068bc29daacb00cc438c3318d6a0b4d628352f9b1d9194"},"schema_version":"1.0"},"canonical_sha256":"5e89d4d9ed6496b7d8541b467e4235b8bd4878add639a08d90d126f0fd2343dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:03.018488Z","signature_b64":"kLDTfxyyOuiI7QRX20EKHPirqsDlSRQ5eLVg+6UQ28jVDGd3MGQrN8rhoMrxPIxv50KR+3wM5xGuJAUFAG2yBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e89d4d9ed6496b7d8541b467e4235b8bd4878add639a08d90d126f0fd2343dd","last_reissued_at":"2026-05-18T02:55:03.018078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:03.018078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0588","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-18T02:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OtBLiB7//gIacmZEPlAjiDl4raq80sCsZ2umIfSlRDOnysrzE9YMesr55EXLjzHpHQjLg1ashujkiao8rnshCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:04:19.065350Z"},"content_sha256":"f7c55e0a18c50168d8c51239314101e487b2837f4f440d8e9fcc1d69b1a6f204","schema_version":"1.0","event_id":"sha256:f7c55e0a18c50168d8c51239314101e487b2837f4f440d8e9fcc1d69b1a6f204"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:L2E5JWPNMSLLPWCUDNDH4QRVXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Labeling Schemes for Bounded Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"David Adjiashvili, Noy Rotbart","submitted_at":"2014-04-02T15:34:57Z","abstract_excerpt":"We investigate adjacency labeling schemes for graphs of bounded degree $\\Delta = O(1)$. In particular, we present an optimal (up to an additive constant) $\\log n + O(1)$ adjacency labeling scheme for bounded degree trees. The latter scheme is derived from a labeling scheme for bounded degree outerplanar graphs. Our results complement a similar bound recently obtained for bounded depth trees [Fraigniaud and Korman, SODA 10], and may provide new insights for closing the long standing gap for adjacency in trees [Alstrup and Rauhe, FOCS 02]. We also provide improved labeling schemes for bounded de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0588","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-18T02:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bAFDaV1rU8rAaFPXsFQKxROyHdsjBZBpoXDDvKSqBDth40CaP3auYAQED2krV3b0tUezWLB5U2GuGSW61zSxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:04:19.065705Z"},"content_sha256":"b6196c9b391178458487f191e1aa0c43e53f0533a23b5999c59739d99f42bf7a","schema_version":"1.0","event_id":"sha256:b6196c9b391178458487f191e1aa0c43e53f0533a23b5999c59739d99f42bf7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2E5JWPNMSLLPWCUDNDH4QRVXC/bundle.json","state_url":"https://pith.science/pith/L2E5JWPNMSLLPWCUDNDH4QRVXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2E5JWPNMSLLPWCUDNDH4QRVXC/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-06-05T14:04:19Z","links":{"resolver":"https://pith.science/pith/L2E5JWPNMSLLPWCUDNDH4QRVXC","bundle":"https://pith.science/pith/L2E5JWPNMSLLPWCUDNDH4QRVXC/bundle.json","state":"https://pith.science/pith/L2E5JWPNMSLLPWCUDNDH4QRVXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2E5JWPNMSLLPWCUDNDH4QRVXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:L2E5JWPNMSLLPWCUDNDH4QRVXC","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":"525f2c62703e2cd108068bc29daacb00cc438c3318d6a0b4d628352f9b1d9194","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-02T15:34:57Z","title_canon_sha256":"9341ae7382db1de6fbcd678f59e09f955c0680e4bf573d72966e3a2c2541f0e5"},"schema_version":"1.0","source":{"id":"1404.0588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0588","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0588v1","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0588","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"L2E5JWPNMSLL","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L2E5JWPNMSLLPWCU","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L2E5JWPN","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:b6196c9b391178458487f191e1aa0c43e53f0533a23b5999c59739d99f42bf7a","target":"graph","created_at":"2026-05-18T02:55:03Z","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":"We investigate adjacency labeling schemes for graphs of bounded degree $\\Delta = O(1)$. In particular, we present an optimal (up to an additive constant) $\\log n + O(1)$ adjacency labeling scheme for bounded degree trees. The latter scheme is derived from a labeling scheme for bounded degree outerplanar graphs. Our results complement a similar bound recently obtained for bounded depth trees [Fraigniaud and Korman, SODA 10], and may provide new insights for closing the long standing gap for adjacency in trees [Alstrup and Rauhe, FOCS 02]. We also provide improved labeling schemes for bounded de","authors_text":"David Adjiashvili, Noy Rotbart","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-02T15:34:57Z","title":"Labeling Schemes for Bounded Degree Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0588","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:f7c55e0a18c50168d8c51239314101e487b2837f4f440d8e9fcc1d69b1a6f204","target":"record","created_at":"2026-05-18T02:55:03Z","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":"525f2c62703e2cd108068bc29daacb00cc438c3318d6a0b4d628352f9b1d9194","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-02T15:34:57Z","title_canon_sha256":"9341ae7382db1de6fbcd678f59e09f955c0680e4bf573d72966e3a2c2541f0e5"},"schema_version":"1.0","source":{"id":"1404.0588","kind":"arxiv","version":1}},"canonical_sha256":"5e89d4d9ed6496b7d8541b467e4235b8bd4878add639a08d90d126f0fd2343dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e89d4d9ed6496b7d8541b467e4235b8bd4878add639a08d90d126f0fd2343dd","first_computed_at":"2026-05-18T02:55:03.018078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:03.018078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kLDTfxyyOuiI7QRX20EKHPirqsDlSRQ5eLVg+6UQ28jVDGd3MGQrN8rhoMrxPIxv50KR+3wM5xGuJAUFAG2yBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:03.018488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7c55e0a18c50168d8c51239314101e487b2837f4f440d8e9fcc1d69b1a6f204","sha256:b6196c9b391178458487f191e1aa0c43e53f0533a23b5999c59739d99f42bf7a"],"state_sha256":"9087cb709e4bfefbb06596f8dacbf12efdf6fedb1185b9049e3179f9e31f53df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlkqrOxDRi6zD2/s0tG37UoVZ3QMBLcGU9EjWtE5uzgJmwdbpys+AdrZWy30uG3tHnJj/UmXZpTLelVt1fC+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:04:19.067615Z","bundle_sha256":"ccdbd4ba68bcf611857f30e948538d3727b6941adea2bb136c5ac89c0032eac6"}}