{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2KP3Y5CT24ARRVDFR4IE2E2UJC","short_pith_number":"pith:2KP3Y5CT","schema_version":"1.0","canonical_sha256":"d29fbc7453d70118d4658f104d135448bd7db6bca1f211efb0b0ff17870b269a","source":{"kind":"arxiv","id":"1106.1085","version":1},"attestation_state":"computed","paper":{"title":"On the Edge-balanced Index Sets of Complete Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elliot Krop, Keli Sikes","submitted_at":"2011-06-06T15:03:27Z","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}. The \\emph{edge-balanced index set} of the graph $G$, $EBI(G)$, is defined as the absolute difference between the number of vertices incident to more edges labeled 1 and the number of vertices incident to more edges labeled 0 over all edge-friendly labelings $f$. In 2009, Lee, Kong, and Wang \\cite{LeeKongWang} found the $EBI(K_{l,n})$ for $l=1,2,3,4,5$ as well "},"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":"1106.1085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-06T15:03:27Z","cross_cats_sorted":[],"title_canon_sha256":"2e937e4d680906076a517530650c1f52901f1f8c1aa8890c567bca9a56d08853","abstract_canon_sha256":"1115a5bc1bf2a8fca5ecbc6ce384896f6fcf570721a9864e7999014cc08094d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:36.467149Z","signature_b64":"DE16zQfgNgGeDsb9LIwGlyXbLKiy39EwFQg8sPqlY0HyiQ8otxuwhB/yXlRu5JRxUWG1cbI6cyHGIza7D3M2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d29fbc7453d70118d4658f104d135448bd7db6bca1f211efb0b0ff17870b269a","last_reissued_at":"2026-05-18T04:20:36.466473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:36.466473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Edge-balanced Index Sets of Complete Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elliot Krop, Keli Sikes","submitted_at":"2011-06-06T15:03:27Z","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}. The \\emph{edge-balanced index set} of the graph $G$, $EBI(G)$, is defined as the absolute difference between the number of vertices incident to more edges labeled 1 and the number of vertices incident to more edges labeled 0 over all edge-friendly labelings $f$. In 2009, Lee, Kong, and Wang \\cite{LeeKongWang} found the $EBI(K_{l,n})$ for $l=1,2,3,4,5$ as well "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1085","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":"1106.1085","created_at":"2026-05-18T04:20:36.466597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1085v1","created_at":"2026-05-18T04:20:36.466597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1085","created_at":"2026-05-18T04:20:36.466597+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KP3Y5CT24AR","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KP3Y5CT24ARRVDF","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KP3Y5CT","created_at":"2026-05-18T12:26:18.847500+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/2KP3Y5CT24ARRVDFR4IE2E2UJC","json":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC.json","graph_json":"https://pith.science/api/pith-number/2KP3Y5CT24ARRVDFR4IE2E2UJC/graph.json","events_json":"https://pith.science/api/pith-number/2KP3Y5CT24ARRVDFR4IE2E2UJC/events.json","paper":"https://pith.science/paper/2KP3Y5CT"},"agent_actions":{"view_html":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC","download_json":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC.json","view_paper":"https://pith.science/paper/2KP3Y5CT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1085&json=true","fetch_graph":"https://pith.science/api/pith-number/2KP3Y5CT24ARRVDFR4IE2E2UJC/graph.json","fetch_events":"https://pith.science/api/pith-number/2KP3Y5CT24ARRVDFR4IE2E2UJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC/action/storage_attestation","attest_author":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC/action/author_attestation","sign_citation":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC/action/citation_signature","submit_replication":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC/action/replication_record"}},"created_at":"2026-05-18T04:20:36.466597+00:00","updated_at":"2026-05-18T04:20:36.466597+00:00"}