{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2KP3Y5CT24ARRVDFR4IE2E2UJC","short_pith_number":"pith:2KP3Y5CT","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"},"canonical_sha256":"d29fbc7453d70118d4658f104d135448bd7db6bca1f211efb0b0ff17870b269a","source":{"kind":"arxiv","id":"1106.1085","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1085","created_at":"2026-05-18T04:20:36Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1085v1","created_at":"2026-05-18T04:20:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1085","created_at":"2026-05-18T04:20:36Z"},{"alias_kind":"pith_short_12","alias_value":"2KP3Y5CT24AR","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2KP3Y5CT24ARRVDF","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2KP3Y5CT","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2KP3Y5CT24ARRVDFR4IE2E2UJC","target":"record","payload":{"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"},"canonical_sha256":"d29fbc7453d70118d4658f104d135448bd7db6bca1f211efb0b0ff17870b269a","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"},"source_kind":"arxiv","source_id":"1106.1085","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:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DldTS/uijRlgg79dSD+TnATGlpuWRtJEK5znYNfqwgqvPIxP69Jo/m+5xNRZKOJPwxiBuBt6FhE/2z9FcPBzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:36:31.254475Z"},"content_sha256":"5f80f54b4b66ae599170caaab06acf0a74c556e812cc62353fa942db442979e7","schema_version":"1.0","event_id":"sha256:5f80f54b4b66ae599170caaab06acf0a74c556e812cc62353fa942db442979e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2KP3Y5CT24ARRVDFR4IE2E2UJC","target":"graph","payload":{"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"},"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:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e2hmsxGmpowwi8ATvoNE6a8o7krrq0cQwoETk2811D0tjhVgpdiMPxaPQ/XGTobfXKCCTvHzVB7Bj+b7kUnWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:36:31.254823Z"},"content_sha256":"37aff123eb842ccf2d11763829197fcf9238c21e27b718f5e28c71b2668ce130","schema_version":"1.0","event_id":"sha256:37aff123eb842ccf2d11763829197fcf9238c21e27b718f5e28c71b2668ce130"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC/bundle.json","state_url":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC/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-07-01T15:36:31Z","links":{"resolver":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC","bundle":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC/bundle.json","state":"https://pith.science/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KP3Y5CT24ARRVDFR4IE2E2UJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2KP3Y5CT24ARRVDFR4IE2E2UJC","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":"1115a5bc1bf2a8fca5ecbc6ce384896f6fcf570721a9864e7999014cc08094d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-06T15:03:27Z","title_canon_sha256":"2e937e4d680906076a517530650c1f52901f1f8c1aa8890c567bca9a56d08853"},"schema_version":"1.0","source":{"id":"1106.1085","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1085","created_at":"2026-05-18T04:20:36Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1085v1","created_at":"2026-05-18T04:20:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1085","created_at":"2026-05-18T04:20:36Z"},{"alias_kind":"pith_short_12","alias_value":"2KP3Y5CT24AR","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2KP3Y5CT24ARRVDF","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2KP3Y5CT","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:37aff123eb842ccf2d11763829197fcf9238c21e27b718f5e28c71b2668ce130","target":"graph","created_at":"2026-05-18T04:20:36Z","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}. 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 ","authors_text":"Elliot Krop, Keli Sikes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-06T15:03:27Z","title":"On the Edge-balanced Index Sets of Complete Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1085","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:5f80f54b4b66ae599170caaab06acf0a74c556e812cc62353fa942db442979e7","target":"record","created_at":"2026-05-18T04:20:36Z","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":"1115a5bc1bf2a8fca5ecbc6ce384896f6fcf570721a9864e7999014cc08094d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-06T15:03:27Z","title_canon_sha256":"2e937e4d680906076a517530650c1f52901f1f8c1aa8890c567bca9a56d08853"},"schema_version":"1.0","source":{"id":"1106.1085","kind":"arxiv","version":1}},"canonical_sha256":"d29fbc7453d70118d4658f104d135448bd7db6bca1f211efb0b0ff17870b269a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d29fbc7453d70118d4658f104d135448bd7db6bca1f211efb0b0ff17870b269a","first_computed_at":"2026-05-18T04:20:36.466473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:36.466473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DE16zQfgNgGeDsb9LIwGlyXbLKiy39EwFQg8sPqlY0HyiQ8otxuwhB/yXlRu5JRxUWG1cbI6cyHGIza7D3M2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:36.467149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1085","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f80f54b4b66ae599170caaab06acf0a74c556e812cc62353fa942db442979e7","sha256:37aff123eb842ccf2d11763829197fcf9238c21e27b718f5e28c71b2668ce130"],"state_sha256":"cb77249f0973bc771c6a9d377048580b99dc456f71c70a07459e6f4fc32b551e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hJNDts+ENJrI0J4nYczHXcicZ4fGMfwquefJ5gn2m6breOrWH6DIdvpXY+au7/DHYrq5ssj8KxEXei+583xBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T15:36:31.256827Z","bundle_sha256":"be27c1401c8f38f12724c2042fff82c605e7e104fee31b1972a5ec35140a6e4c"}}