{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HD66HVXVMQNWUHB7BCIIQO2L5C","short_pith_number":"pith:HD66HVXV","schema_version":"1.0","canonical_sha256":"38fde3d6f5641b6a1c3f0890883b4be8badfb67cd507f1658b00c377a4382c27","source":{"kind":"arxiv","id":"1907.06378","version":1},"attestation_state":"computed","paper":{"title":"Edge-bipancyclicity of bubble-sort star graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia Guo, Mei Lu","submitted_at":"2019-07-15T09:10:49Z","abstract_excerpt":"The interconnection network considered in this paper is the bubble-sort star graph. The $n$-dimensional bubble-sort star graph $BS_n$ is a bipartite and $(2n-3)$-regular graph of order $n!$. A bipartite graph $G$ is edge-bipancyclic if each edge of $G$ lies on a cycle of all even length $l$ with $4\\leq l\\leq |V(G)|$. In this paper, we show that the $n$-dimensional bubble-sort star graph $BS_n$ is edge-bipancyclic for $n\\ge 3$ and for each even length $l$ with $4\\leq l\\leq n!$, every edge of $BS_n$ lies on at least four different cycles of length $l$."},"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":"1907.06378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-15T09:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"4955031a0c607ca90f11e535898731c31d766a923aa915957d82dc23727fac46","abstract_canon_sha256":"a49d7fbec49a531ef3cb5313897bb7abbf30e7ed495fddec8c8f6bd01a7ab9e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:37.783179Z","signature_b64":"b/rPtpEt6lQOPQsmxY8Hc+7mE9JV8jxonvkp2KeUp/+ubI3ZPhpdmhtEAFgyKIxu9y7wIbLSK6+hRGqEj3seBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38fde3d6f5641b6a1c3f0890883b4be8badfb67cd507f1658b00c377a4382c27","last_reissued_at":"2026-05-17T23:40:37.782616Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:37.782616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-bipancyclicity of bubble-sort star graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia Guo, Mei Lu","submitted_at":"2019-07-15T09:10:49Z","abstract_excerpt":"The interconnection network considered in this paper is the bubble-sort star graph. The $n$-dimensional bubble-sort star graph $BS_n$ is a bipartite and $(2n-3)$-regular graph of order $n!$. A bipartite graph $G$ is edge-bipancyclic if each edge of $G$ lies on a cycle of all even length $l$ with $4\\leq l\\leq |V(G)|$. In this paper, we show that the $n$-dimensional bubble-sort star graph $BS_n$ is edge-bipancyclic for $n\\ge 3$ and for each even length $l$ with $4\\leq l\\leq n!$, every edge of $BS_n$ lies on at least four different cycles of length $l$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06378","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":"1907.06378","created_at":"2026-05-17T23:40:37.782694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06378v1","created_at":"2026-05-17T23:40:37.782694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06378","created_at":"2026-05-17T23:40:37.782694+00:00"},{"alias_kind":"pith_short_12","alias_value":"HD66HVXVMQNW","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HD66HVXVMQNWUHB7","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HD66HVXV","created_at":"2026-05-18T12:33:18.533446+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/HD66HVXVMQNWUHB7BCIIQO2L5C","json":"https://pith.science/pith/HD66HVXVMQNWUHB7BCIIQO2L5C.json","graph_json":"https://pith.science/api/pith-number/HD66HVXVMQNWUHB7BCIIQO2L5C/graph.json","events_json":"https://pith.science/api/pith-number/HD66HVXVMQNWUHB7BCIIQO2L5C/events.json","paper":"https://pith.science/paper/HD66HVXV"},"agent_actions":{"view_html":"https://pith.science/pith/HD66HVXVMQNWUHB7BCIIQO2L5C","download_json":"https://pith.science/pith/HD66HVXVMQNWUHB7BCIIQO2L5C.json","view_paper":"https://pith.science/paper/HD66HVXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06378&json=true","fetch_graph":"https://pith.science/api/pith-number/HD66HVXVMQNWUHB7BCIIQO2L5C/graph.json","fetch_events":"https://pith.science/api/pith-number/HD66HVXVMQNWUHB7BCIIQO2L5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HD66HVXVMQNWUHB7BCIIQO2L5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HD66HVXVMQNWUHB7BCIIQO2L5C/action/storage_attestation","attest_author":"https://pith.science/pith/HD66HVXVMQNWUHB7BCIIQO2L5C/action/author_attestation","sign_citation":"https://pith.science/pith/HD66HVXVMQNWUHB7BCIIQO2L5C/action/citation_signature","submit_replication":"https://pith.science/pith/HD66HVXVMQNWUHB7BCIIQO2L5C/action/replication_record"}},"created_at":"2026-05-17T23:40:37.782694+00:00","updated_at":"2026-05-17T23:40:37.782694+00:00"}