{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:STWPIGEDEIQFN3CK5PIVIBLG32","short_pith_number":"pith:STWPIGED","schema_version":"1.0","canonical_sha256":"94ecf41883222056ec4aebd1540566deaf1ced13deca8e204b09b843c289202f","source":{"kind":"arxiv","id":"1509.01841","version":1},"attestation_state":"computed","paper":{"title":"On the Edge-Balanced Index Sets of Complete Even Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Raridan, Ha Dao, Hung Hua, Michael Ngo","submitted_at":"2015-09-06T18:20:41Z","abstract_excerpt":"In 2009, Kong, Wang, and Lee introduced the problem of finding the edge-balanced index sets ($EBI$) of complete bipartite graphs $K_{m,n}$, where they examined the cases $n=1$, $2$, $3$, $4$, $5$ and the case $m=n$. Since then the problem of finding $EBI(K_{m,n})$, where $m \\geq n$, has been completely resolved for the $m,n=$ odd, odd and odd, even cases. In this paper we find the edge-balanced index sets for complete bipartite graphs where both parts have even cardinality."},"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":"1509.01841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-06T18:20:41Z","cross_cats_sorted":[],"title_canon_sha256":"7ee5516ec9ced9e1296f8be7d436a32d539ae47f923d309b9b169a4759ea5bf1","abstract_canon_sha256":"2610d06c1b6bce4b6480e8f92595d04cc5ea79dba77edfbfd75e3b92506cd134"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:50.407690Z","signature_b64":"UB8pRKagsdmgiit2nTW77BjbnNWBt07gcXdXUXPneJdj0INpfifCnyHU2fwCZz5KLOgkA3bNJ2LHTlJ3xJlPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94ecf41883222056ec4aebd1540566deaf1ced13deca8e204b09b843c289202f","last_reissued_at":"2026-05-18T01:33:50.407011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:50.407011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Edge-Balanced Index Sets of Complete Even Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Raridan, Ha Dao, Hung Hua, Michael Ngo","submitted_at":"2015-09-06T18:20:41Z","abstract_excerpt":"In 2009, Kong, Wang, and Lee introduced the problem of finding the edge-balanced index sets ($EBI$) of complete bipartite graphs $K_{m,n}$, where they examined the cases $n=1$, $2$, $3$, $4$, $5$ and the case $m=n$. Since then the problem of finding $EBI(K_{m,n})$, where $m \\geq n$, has been completely resolved for the $m,n=$ odd, odd and odd, even cases. In this paper we find the edge-balanced index sets for complete bipartite graphs where both parts have even cardinality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01841","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":"1509.01841","created_at":"2026-05-18T01:33:50.407110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01841v1","created_at":"2026-05-18T01:33:50.407110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01841","created_at":"2026-05-18T01:33:50.407110+00:00"},{"alias_kind":"pith_short_12","alias_value":"STWPIGEDEIQF","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"STWPIGEDEIQFN3CK","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"STWPIGED","created_at":"2026-05-18T12:29:42.218222+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/STWPIGEDEIQFN3CK5PIVIBLG32","json":"https://pith.science/pith/STWPIGEDEIQFN3CK5PIVIBLG32.json","graph_json":"https://pith.science/api/pith-number/STWPIGEDEIQFN3CK5PIVIBLG32/graph.json","events_json":"https://pith.science/api/pith-number/STWPIGEDEIQFN3CK5PIVIBLG32/events.json","paper":"https://pith.science/paper/STWPIGED"},"agent_actions":{"view_html":"https://pith.science/pith/STWPIGEDEIQFN3CK5PIVIBLG32","download_json":"https://pith.science/pith/STWPIGEDEIQFN3CK5PIVIBLG32.json","view_paper":"https://pith.science/paper/STWPIGED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01841&json=true","fetch_graph":"https://pith.science/api/pith-number/STWPIGEDEIQFN3CK5PIVIBLG32/graph.json","fetch_events":"https://pith.science/api/pith-number/STWPIGEDEIQFN3CK5PIVIBLG32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STWPIGEDEIQFN3CK5PIVIBLG32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STWPIGEDEIQFN3CK5PIVIBLG32/action/storage_attestation","attest_author":"https://pith.science/pith/STWPIGEDEIQFN3CK5PIVIBLG32/action/author_attestation","sign_citation":"https://pith.science/pith/STWPIGEDEIQFN3CK5PIVIBLG32/action/citation_signature","submit_replication":"https://pith.science/pith/STWPIGEDEIQFN3CK5PIVIBLG32/action/replication_record"}},"created_at":"2026-05-18T01:33:50.407110+00:00","updated_at":"2026-05-18T01:33:50.407110+00:00"}