{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PCVMCBIZUMSMXDNK7E64QVZNJP","short_pith_number":"pith:PCVMCBIZ","schema_version":"1.0","canonical_sha256":"78aac10519a324cb8daaf93dc8572d4be002ebb4b8d82fda016fda3ac30d6afd","source":{"kind":"arxiv","id":"1103.4994","version":1},"attestation_state":"computed","paper":{"title":"On the edge-balanced index sets of product 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-25T15:27:54Z","abstract_excerpt":"We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\\times K_2$. We also prove a lemma that is helpful to determine the edge-balanced index sets of regular graphs."},"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.4994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-25T15:27:54Z","cross_cats_sorted":[],"title_canon_sha256":"de90079f6bc6102a2a77b26632e9383a3ab93d3801dc0629d42464a04cb554d4","abstract_canon_sha256":"557e78006a11412d3f9f2e3f58a6f6ce9fb1cccd5109688cdc67db0fdbaacf38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:27.321244Z","signature_b64":"GHFE15SUpdJY+K6v5/MqmkdLVscEQ88Fu/avPR0KqaOq7Le/VcLnjjCNRNhHDOPt9KvdxGgnQOMeY9T01aClAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78aac10519a324cb8daaf93dc8572d4be002ebb4b8d82fda016fda3ac30d6afd","last_reissued_at":"2026-05-18T03:00:27.320357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:27.320357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the edge-balanced index sets of product 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-25T15:27:54Z","abstract_excerpt":"We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\\times K_2$. We also prove a lemma that is helpful to determine the edge-balanced index sets of regular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4994","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.4994","created_at":"2026-05-18T03:00:27.320503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.4994v1","created_at":"2026-05-18T03:00:27.320503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4994","created_at":"2026-05-18T03:00:27.320503+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCVMCBIZUMSM","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCVMCBIZUMSMXDNK","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCVMCBIZ","created_at":"2026-05-18T12:26:39.201973+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/PCVMCBIZUMSMXDNK7E64QVZNJP","json":"https://pith.science/pith/PCVMCBIZUMSMXDNK7E64QVZNJP.json","graph_json":"https://pith.science/api/pith-number/PCVMCBIZUMSMXDNK7E64QVZNJP/graph.json","events_json":"https://pith.science/api/pith-number/PCVMCBIZUMSMXDNK7E64QVZNJP/events.json","paper":"https://pith.science/paper/PCVMCBIZ"},"agent_actions":{"view_html":"https://pith.science/pith/PCVMCBIZUMSMXDNK7E64QVZNJP","download_json":"https://pith.science/pith/PCVMCBIZUMSMXDNK7E64QVZNJP.json","view_paper":"https://pith.science/paper/PCVMCBIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.4994&json=true","fetch_graph":"https://pith.science/api/pith-number/PCVMCBIZUMSMXDNK7E64QVZNJP/graph.json","fetch_events":"https://pith.science/api/pith-number/PCVMCBIZUMSMXDNK7E64QVZNJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCVMCBIZUMSMXDNK7E64QVZNJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCVMCBIZUMSMXDNK7E64QVZNJP/action/storage_attestation","attest_author":"https://pith.science/pith/PCVMCBIZUMSMXDNK7E64QVZNJP/action/author_attestation","sign_citation":"https://pith.science/pith/PCVMCBIZUMSMXDNK7E64QVZNJP/action/citation_signature","submit_replication":"https://pith.science/pith/PCVMCBIZUMSMXDNK7E64QVZNJP/action/replication_record"}},"created_at":"2026-05-18T03:00:27.320503+00:00","updated_at":"2026-05-18T03:00:27.320503+00:00"}