{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:APJETUM3Z537YUZR3TJQJC5YYT","short_pith_number":"pith:APJETUM3","schema_version":"1.0","canonical_sha256":"03d249d19bcf77fc5331dcd3048bb8c4c1fa9c79f661c946ede8fd19b843ee72","source":{"kind":"arxiv","id":"1103.5127","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.5127","created_at":"2026-05-18T04:20:37.731244+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5127v1","created_at":"2026-05-18T04:20:37.731244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5127","created_at":"2026-05-18T04:20:37.731244+00:00"},{"alias_kind":"pith_short_12","alias_value":"APJETUM3Z537","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"APJETUM3Z537YUZR","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"APJETUM3","created_at":"2026-05-18T12:26:24.575870+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/APJETUM3Z537YUZR3TJQJC5YYT","json":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT.json","graph_json":"https://pith.science/api/pith-number/APJETUM3Z537YUZR3TJQJC5YYT/graph.json","events_json":"https://pith.science/api/pith-number/APJETUM3Z537YUZR3TJQJC5YYT/events.json","paper":"https://pith.science/paper/APJETUM3"},"agent_actions":{"view_html":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT","download_json":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT.json","view_paper":"https://pith.science/paper/APJETUM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5127&json=true","fetch_graph":"https://pith.science/api/pith-number/APJETUM3Z537YUZR3TJQJC5YYT/graph.json","fetch_events":"https://pith.science/api/pith-number/APJETUM3Z537YUZR3TJQJC5YYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT/action/storage_attestation","attest_author":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT/action/author_attestation","sign_citation":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT/action/citation_signature","submit_replication":"https://pith.science/pith/APJETUM3Z537YUZR3TJQJC5YYT/action/replication_record"}},"created_at":"2026-05-18T04:20:37.731244+00:00","updated_at":"2026-05-18T04:20:37.731244+00:00"}