{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NZAB47VLIU63HSFYI3UXPK32XP","short_pith_number":"pith:NZAB47VL","canonical_record":{"source":{"id":"1307.8071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-30T18:04:53Z","cross_cats_sorted":[],"title_canon_sha256":"2598c6f859913634ca09ecf8b331258e948254210c8eb6b7af5d4d7c8f8960da","abstract_canon_sha256":"d84aa84238cd96cda0b1dfa4a39cb06b54772f019150679a549ef23d23a23bb6"},"schema_version":"1.0"},"canonical_sha256":"6e401e7eab453db3c8b846e977ab7abbc23fafc08de7b5f045602b19d754116b","source":{"kind":"arxiv","id":"1307.8071","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8071","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8071v1","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8071","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"NZAB47VLIU63","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"NZAB47VLIU63HSFY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"NZAB47VL","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NZAB47VLIU63HSFYI3UXPK32XP","target":"record","payload":{"canonical_record":{"source":{"id":"1307.8071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-30T18:04:53Z","cross_cats_sorted":[],"title_canon_sha256":"2598c6f859913634ca09ecf8b331258e948254210c8eb6b7af5d4d7c8f8960da","abstract_canon_sha256":"d84aa84238cd96cda0b1dfa4a39cb06b54772f019150679a549ef23d23a23bb6"},"schema_version":"1.0"},"canonical_sha256":"6e401e7eab453db3c8b846e977ab7abbc23fafc08de7b5f045602b19d754116b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:12.502417Z","signature_b64":"o8QJBs8HdYj1xJND044KwBd1tBCAovGFJ4NqmaLmg/drud3ULDeSu4/NGolGfV/atlgsl+F/hcyNSrqG4ZAEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e401e7eab453db3c8b846e977ab7abbc23fafc08de7b5f045602b19d754116b","last_reissued_at":"2026-05-18T03:17:12.501728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:12.501728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.8071","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-18T03:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U0q7dj5HdPTzSZTs30S2L5qOzqslVz8NvEsbdzJVgcjim4uG7MWRCfxfUVcCp554w2hDWkycMPZZ4HTJ1jmEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:33:05.661452Z"},"content_sha256":"b66b504fed82472bc135f1971a05b8a68e5664c5d2e87731da7d9957458c727d","schema_version":"1.0","event_id":"sha256:b66b504fed82472bc135f1971a05b8a68e5664c5d2e87731da7d9957458c727d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NZAB47VLIU63HSFYI3UXPK32XP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Solution to the Edge-Balanced Index Set Problem for Complete Odd Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Raridan, E. Krop, P. Patel, S. Minion","submitted_at":"2013-07-30T18:04:53Z","abstract_excerpt":"In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets (EBI) of complete bipartite graphs K_{m,n} by solving the cases where n = 1, 2, 3, 4, and 5, and also the case where m = n. In 2011, Krop and Sikes expanded upon that work by finding EBI(K_{m,m-2a}) for odd m > 5 and 1 <= a <= (m-3)/4. In this paper, we provide a general solution to the edge-balanced index set problem for all complete odd bipartite graphs, thereby concluding the problem for this case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8071","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-18T03:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcJ5oUNu9X2jUfeD6cnM4jHLzb/I/5YTba9mwGbj0XhgVYlRZbY9QYhpkOadsyW0z22rzyyNLC0zJ47e6HRBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:33:05.662246Z"},"content_sha256":"f75453381dc643beeef29cbdc684292bb39ba2ecac2c4eef3b734d59f89c0ad5","schema_version":"1.0","event_id":"sha256:f75453381dc643beeef29cbdc684292bb39ba2ecac2c4eef3b734d59f89c0ad5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZAB47VLIU63HSFYI3UXPK32XP/bundle.json","state_url":"https://pith.science/pith/NZAB47VLIU63HSFYI3UXPK32XP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZAB47VLIU63HSFYI3UXPK32XP/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-04T20:33:05Z","links":{"resolver":"https://pith.science/pith/NZAB47VLIU63HSFYI3UXPK32XP","bundle":"https://pith.science/pith/NZAB47VLIU63HSFYI3UXPK32XP/bundle.json","state":"https://pith.science/pith/NZAB47VLIU63HSFYI3UXPK32XP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZAB47VLIU63HSFYI3UXPK32XP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NZAB47VLIU63HSFYI3UXPK32XP","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":"d84aa84238cd96cda0b1dfa4a39cb06b54772f019150679a549ef23d23a23bb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-30T18:04:53Z","title_canon_sha256":"2598c6f859913634ca09ecf8b331258e948254210c8eb6b7af5d4d7c8f8960da"},"schema_version":"1.0","source":{"id":"1307.8071","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8071","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8071v1","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8071","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"NZAB47VLIU63","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"NZAB47VLIU63HSFY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"NZAB47VL","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:f75453381dc643beeef29cbdc684292bb39ba2ecac2c4eef3b734d59f89c0ad5","target":"graph","created_at":"2026-05-18T03:17:12Z","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":"In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets (EBI) of complete bipartite graphs K_{m,n} by solving the cases where n = 1, 2, 3, 4, and 5, and also the case where m = n. In 2011, Krop and Sikes expanded upon that work by finding EBI(K_{m,m-2a}) for odd m > 5 and 1 <= a <= (m-3)/4. In this paper, we provide a general solution to the edge-balanced index set problem for all complete odd bipartite graphs, thereby concluding the problem for this case.","authors_text":"C. Raridan, E. Krop, P. Patel, S. Minion","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-30T18:04:53Z","title":"A Solution to the Edge-Balanced Index Set Problem for Complete Odd Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8071","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:b66b504fed82472bc135f1971a05b8a68e5664c5d2e87731da7d9957458c727d","target":"record","created_at":"2026-05-18T03:17:12Z","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":"d84aa84238cd96cda0b1dfa4a39cb06b54772f019150679a549ef23d23a23bb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-30T18:04:53Z","title_canon_sha256":"2598c6f859913634ca09ecf8b331258e948254210c8eb6b7af5d4d7c8f8960da"},"schema_version":"1.0","source":{"id":"1307.8071","kind":"arxiv","version":1}},"canonical_sha256":"6e401e7eab453db3c8b846e977ab7abbc23fafc08de7b5f045602b19d754116b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e401e7eab453db3c8b846e977ab7abbc23fafc08de7b5f045602b19d754116b","first_computed_at":"2026-05-18T03:17:12.501728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:12.501728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o8QJBs8HdYj1xJND044KwBd1tBCAovGFJ4NqmaLmg/drud3ULDeSu4/NGolGfV/atlgsl+F/hcyNSrqG4ZAEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:12.502417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.8071","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b66b504fed82472bc135f1971a05b8a68e5664c5d2e87731da7d9957458c727d","sha256:f75453381dc643beeef29cbdc684292bb39ba2ecac2c4eef3b734d59f89c0ad5"],"state_sha256":"9762027e1e5f99ccf6d5697ef587abaee371be483b75f303570b86f4f452459a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8orF5JYMnf6CSUDaV1RO605JF19uoOD1mudlFI4VF/Kw6SRldZOBZ3AAstnP5prnF9t4wL0qkMEG7pL2OR75Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:33:05.666140Z","bundle_sha256":"2691a616052f885d9dadefb223d3cf05982bb4f5561a5a2aa6442780fce11447"}}