{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:APJETUM3Z537YUZR3TJQJC5YYT","short_pith_number":"pith:APJETUM3","canonical_record":{"source":{"id":"1103.5127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-26T12:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"637d7351bcab5e88933f4ae052d484d1204a5e434da01b60085a7f51c1f2fcba","abstract_canon_sha256":"78d9d99dbee2fe9f12cf920176dcd330ac98ceac5da0617c357f80ea05e94786"},"schema_version":"1.0"},"canonical_sha256":"03d249d19bcf77fc5331dcd3048bb8c4c1fa9c79f661c946ede8fd19b843ee72","source":{"kind":"arxiv","id":"1103.5127","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5127","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5127v1","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5127","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"APJETUM3Z537","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"APJETUM3Z537YUZR","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"APJETUM3","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:APJETUM3Z537YUZR3TJQJC5YYT","target":"record","payload":{"canonical_record":{"source":{"id":"1103.5127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-26T12:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"637d7351bcab5e88933f4ae052d484d1204a5e434da01b60085a7f51c1f2fcba","abstract_canon_sha256":"78d9d99dbee2fe9f12cf920176dcd330ac98ceac5da0617c357f80ea05e94786"},"schema_version":"1.0"},"canonical_sha256":"03d249d19bcf77fc5331dcd3048bb8c4c1fa9c79f661c946ede8fd19b843ee72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:37.731662Z","signature_b64":"aSLh7RiphSDJqe1+9OOTFmKU8SiNfkWn7WVUXdDI5/iU5oGA6qJz6t22gmFPxkcewxLQTDXxF+jJpiS43h2KAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03d249d19bcf77fc5331dcd3048bb8c4c1fa9c79f661c946ede8fd19b843ee72","last_reissued_at":"2026-05-18T04:20:37.731167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:37.731167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.5127","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-18T04:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHxIoIbQX/J4xZJ8CkigNUwlVZ7wegeeSDCF1Ik+WY0mGCuPnD2lidm3fBkuxSpYWUwMh60gXGrwsRC7VWpbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:28:55.754279Z"},"content_sha256":"ac4514244376c73a573edcd94a5e22f59083b60c7920b1265039c33dca895283","schema_version":"1.0","event_id":"sha256:ac4514244376c73a573edcd94a5e22f59083b60c7920b1265039c33dca895283"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:APJETUM3Z537YUZR3TJQJC5YYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of unlabeled vertices in edge-friendly labelings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Raridan, Elliot Krop, Sin-Min Lee","submitted_at":"2011-03-26T12:57:46Z","abstract_excerpt":"Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $f$ be a 0-1 labeling of $E(G)$ so that the absolute difference in the number of edges labeled 1 and 0 is no more than one. Call such a labeling $f$ \\emph{edge-friendly}. We say an edge-friendly labeling induces a \\emph{partial vertex labeling} if vertices which are incident to more edges labeled 1 than 0, are labeled 1, and vertices which are incident to more edges labeled 0 than 1, are labeled 0. Vertices that are incident to an equal number of edges of both labels we call \\emph{unlabeled}. Call a procedure on a labeled graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5127","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-18T04:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H8f7qrZQ+2lJa/Y98tLTKcShi8i2lqoIXt3tAsXTvLmw/cjRFeYSMZveVDV5nKpgjOHNpcOgZMvJR83ifVkqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:28:55.754662Z"},"content_sha256":"5e4f739d4f5a1e59685845558ffaf9d87e1910cc7b6a76cd078456b15287f21a","schema_version":"1.0","event_id":"sha256:5e4f739d4f5a1e59685845558ffaf9d87e1910cc7b6a76cd078456b15287f21a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT/bundle.json","state_url":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APJETUM3Z537YUZR3TJQJC5YYT/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-22T13:28:55Z","links":{"resolver":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT","bundle":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT/bundle.json","state":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APJETUM3Z537YUZR3TJQJC5YYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:APJETUM3Z537YUZR3TJQJC5YYT","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":"78d9d99dbee2fe9f12cf920176dcd330ac98ceac5da0617c357f80ea05e94786","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-26T12:57:46Z","title_canon_sha256":"637d7351bcab5e88933f4ae052d484d1204a5e434da01b60085a7f51c1f2fcba"},"schema_version":"1.0","source":{"id":"1103.5127","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5127","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5127v1","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5127","created_at":"2026-05-18T04:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"APJETUM3Z537","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"APJETUM3Z537YUZR","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"APJETUM3","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:5e4f739d4f5a1e59685845558ffaf9d87e1910cc7b6a76cd078456b15287f21a","target":"graph","created_at":"2026-05-18T04:20:37Z","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":"Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $f$ be a 0-1 labeling of $E(G)$ so that the absolute difference in the number of edges labeled 1 and 0 is no more than one. Call such a labeling $f$ \\emph{edge-friendly}. We say an edge-friendly labeling induces a \\emph{partial vertex labeling} if vertices which are incident to more edges labeled 1 than 0, are labeled 1, and vertices which are incident to more edges labeled 0 than 1, are labeled 0. Vertices that are incident to an equal number of edges of both labels we call \\emph{unlabeled}. Call a procedure on a labeled graph","authors_text":"Christopher Raridan, Elliot Krop, Sin-Min Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-26T12:57:46Z","title":"On the number of unlabeled vertices in edge-friendly labelings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5127","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:ac4514244376c73a573edcd94a5e22f59083b60c7920b1265039c33dca895283","target":"record","created_at":"2026-05-18T04:20:37Z","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":"78d9d99dbee2fe9f12cf920176dcd330ac98ceac5da0617c357f80ea05e94786","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-26T12:57:46Z","title_canon_sha256":"637d7351bcab5e88933f4ae052d484d1204a5e434da01b60085a7f51c1f2fcba"},"schema_version":"1.0","source":{"id":"1103.5127","kind":"arxiv","version":1}},"canonical_sha256":"03d249d19bcf77fc5331dcd3048bb8c4c1fa9c79f661c946ede8fd19b843ee72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03d249d19bcf77fc5331dcd3048bb8c4c1fa9c79f661c946ede8fd19b843ee72","first_computed_at":"2026-05-18T04:20:37.731167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:37.731167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aSLh7RiphSDJqe1+9OOTFmKU8SiNfkWn7WVUXdDI5/iU5oGA6qJz6t22gmFPxkcewxLQTDXxF+jJpiS43h2KAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:37.731662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5127","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac4514244376c73a573edcd94a5e22f59083b60c7920b1265039c33dca895283","sha256:5e4f739d4f5a1e59685845558ffaf9d87e1910cc7b6a76cd078456b15287f21a"],"state_sha256":"739981bca69d41db1f4bc63a38d8b9a49a0a34a0cb7d1eb377de090bb2e30298"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSSE7MqM58aB/8iYOLyP8zKSAvFcLxyLPBZS6E+wSagK5Cf1KnUV6AODNHFyg9B2NeCZy40d+j2n5j5kQ5bCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:28:55.756654Z","bundle_sha256":"c5c293e840993ea1de394c2c4b0eea7fe35fedd88d7f812bf3c1d0d319ab9699"}}