{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NRH5M3YDF6JTKJ6SIGHMOAKLJK","short_pith_number":"pith:NRH5M3YD","canonical_record":{"source":{"id":"1703.07058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T05:20:00Z","cross_cats_sorted":[],"title_canon_sha256":"512f49dcc82334006f0d5f89c58ed51ca84b87b80b7bca4f27c487b71501991a","abstract_canon_sha256":"fbabd292bbecd1d7dd3275fa637cd3475e60395aaba70d30bc01fe8c1255b898"},"schema_version":"1.0"},"canonical_sha256":"6c4fd66f032f933527d2418ec7014b4aa03c35d7836ed43dadc851246a86101e","source":{"kind":"arxiv","id":"1703.07058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07058","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07058v1","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07058","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"NRH5M3YDF6JT","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NRH5M3YDF6JTKJ6S","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NRH5M3YD","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NRH5M3YDF6JTKJ6SIGHMOAKLJK","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T05:20:00Z","cross_cats_sorted":[],"title_canon_sha256":"512f49dcc82334006f0d5f89c58ed51ca84b87b80b7bca4f27c487b71501991a","abstract_canon_sha256":"fbabd292bbecd1d7dd3275fa637cd3475e60395aaba70d30bc01fe8c1255b898"},"schema_version":"1.0"},"canonical_sha256":"6c4fd66f032f933527d2418ec7014b4aa03c35d7836ed43dadc851246a86101e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:11.444707Z","signature_b64":"FYSfSGGXM5WBxP+QHpt9S0T+uWipg+mMO9IUjP46GsI+ipkJ22yOEfch9x+bUUJI4h2qccnEScjpsoYDzB+SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c4fd66f032f933527d2418ec7014b4aa03c35d7836ed43dadc851246a86101e","last_reissued_at":"2026-05-18T00:48:11.444122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:11.444122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07058","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-18T00:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+xQJrMa9q5lj0m9aNG7mOQOLJ1lou41kmrX7MmYMLPujL84AaGARWJMy/iyGPbiGbaV3uxNCl0Sl53ME8QqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:30:25.956263Z"},"content_sha256":"68e8d569de8be726b54ce9a0ff3a10e77f84cda97c17e92259a6bdcd11e4c1ab","schema_version":"1.0","event_id":"sha256:68e8d569de8be726b54ce9a0ff3a10e77f84cda97c17e92259a6bdcd11e4c1ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NRH5M3YDF6JTKJ6SIGHMOAKLJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Jacobian group and complexity of I-graph I(n,k,l) through Chebyshev polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ilya Mednykh","submitted_at":"2017-03-21T05:20:00Z","abstract_excerpt":"We consider a family of I-graphs I(n,k,l), which is a generalization of the class of generalized Petersen graphs. In the present paper, we provide a new method for counting Jacobian group of the I-graph I(n,k,l). We show that the minimum number of generators of Jac(I(n,k,l)) is at least two and at most 2k + 2l - 1. Also, we obtain a closed formula for the number of spanning trees of I(n,k,l) in terms of Chebyshev polynomials. We investigate some arithmetical properties of this number and its asymptotic behaviour."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07058","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-18T00:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jc9sAEUWOwY3I1dJjVSOcZtpvKG2U0H6/dsIuDz4ByQhaoJv3YzB3q0CnBWZIXUQClokc1upnkvTSrQ7+twSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:30:25.956624Z"},"content_sha256":"d7f16b58a2d163bac0226e143b929813be9bcd2a99059465d7f694a33a86fe5a","schema_version":"1.0","event_id":"sha256:d7f16b58a2d163bac0226e143b929813be9bcd2a99059465d7f694a33a86fe5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRH5M3YDF6JTKJ6SIGHMOAKLJK/bundle.json","state_url":"https://pith.science/pith/NRH5M3YDF6JTKJ6SIGHMOAKLJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRH5M3YDF6JTKJ6SIGHMOAKLJK/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-03T19:30:25Z","links":{"resolver":"https://pith.science/pith/NRH5M3YDF6JTKJ6SIGHMOAKLJK","bundle":"https://pith.science/pith/NRH5M3YDF6JTKJ6SIGHMOAKLJK/bundle.json","state":"https://pith.science/pith/NRH5M3YDF6JTKJ6SIGHMOAKLJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRH5M3YDF6JTKJ6SIGHMOAKLJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NRH5M3YDF6JTKJ6SIGHMOAKLJK","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":"fbabd292bbecd1d7dd3275fa637cd3475e60395aaba70d30bc01fe8c1255b898","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T05:20:00Z","title_canon_sha256":"512f49dcc82334006f0d5f89c58ed51ca84b87b80b7bca4f27c487b71501991a"},"schema_version":"1.0","source":{"id":"1703.07058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07058","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07058v1","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07058","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"NRH5M3YDF6JT","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NRH5M3YDF6JTKJ6S","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NRH5M3YD","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:d7f16b58a2d163bac0226e143b929813be9bcd2a99059465d7f694a33a86fe5a","target":"graph","created_at":"2026-05-18T00:48:11Z","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":"We consider a family of I-graphs I(n,k,l), which is a generalization of the class of generalized Petersen graphs. In the present paper, we provide a new method for counting Jacobian group of the I-graph I(n,k,l). We show that the minimum number of generators of Jac(I(n,k,l)) is at least two and at most 2k + 2l - 1. Also, we obtain a closed formula for the number of spanning trees of I(n,k,l) in terms of Chebyshev polynomials. We investigate some arithmetical properties of this number and its asymptotic behaviour.","authors_text":"Ilya Mednykh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T05:20:00Z","title":"On Jacobian group and complexity of I-graph I(n,k,l) through Chebyshev polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07058","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:68e8d569de8be726b54ce9a0ff3a10e77f84cda97c17e92259a6bdcd11e4c1ab","target":"record","created_at":"2026-05-18T00:48:11Z","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":"fbabd292bbecd1d7dd3275fa637cd3475e60395aaba70d30bc01fe8c1255b898","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T05:20:00Z","title_canon_sha256":"512f49dcc82334006f0d5f89c58ed51ca84b87b80b7bca4f27c487b71501991a"},"schema_version":"1.0","source":{"id":"1703.07058","kind":"arxiv","version":1}},"canonical_sha256":"6c4fd66f032f933527d2418ec7014b4aa03c35d7836ed43dadc851246a86101e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c4fd66f032f933527d2418ec7014b4aa03c35d7836ed43dadc851246a86101e","first_computed_at":"2026-05-18T00:48:11.444122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:11.444122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FYSfSGGXM5WBxP+QHpt9S0T+uWipg+mMO9IUjP46GsI+ipkJ22yOEfch9x+bUUJI4h2qccnEScjpsoYDzB+SBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:11.444707Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68e8d569de8be726b54ce9a0ff3a10e77f84cda97c17e92259a6bdcd11e4c1ab","sha256:d7f16b58a2d163bac0226e143b929813be9bcd2a99059465d7f694a33a86fe5a"],"state_sha256":"5d6353e0df94b73ca5e625351d8d15151feb77a70a4bcce02891e20880e5ff14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1kuHFA+QGe9nxTRMuorUKJwtW++mqN2eftigZIBX1JMIEsTiaLrFDvRsketePaCJgjCijlHWYcRVVUMHajvLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:30:25.958651Z","bundle_sha256":"3b7ba3005ca4d3e4edd43779f6ad9a3a368144b8eea145a7fb1e9ac4f91e0824"}}