{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:FF6IS4XLWM5KMABG64SFJ76JHJ","short_pith_number":"pith:FF6IS4XL","canonical_record":{"source":{"id":"0907.4764","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-27T20:36:21Z","cross_cats_sorted":["cs.CR","math.AG"],"title_canon_sha256":"79ae47af80d17b4e0fd7ef6a079029d59f6dc2cc67862578d704f6d17eefaec0","abstract_canon_sha256":"ed23142023fad0b11d1a5319cc201f5ccef5900386a86f1269c8f807de5aaa81"},"schema_version":"1.0"},"canonical_sha256":"297c8972ebb33aa60026f72454ffc93a62523968fdec462451387f050fe82d42","source":{"kind":"arxiv","id":"0907.4764","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.4764","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"0907.4764v2","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.4764","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"FF6IS4XLWM5K","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"FF6IS4XLWM5KMABG","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"FF6IS4XL","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:FF6IS4XLWM5KMABG64SFJ76JHJ","target":"record","payload":{"canonical_record":{"source":{"id":"0907.4764","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-27T20:36:21Z","cross_cats_sorted":["cs.CR","math.AG"],"title_canon_sha256":"79ae47af80d17b4e0fd7ef6a079029d59f6dc2cc67862578d704f6d17eefaec0","abstract_canon_sha256":"ed23142023fad0b11d1a5319cc201f5ccef5900386a86f1269c8f807de5aaa81"},"schema_version":"1.0"},"canonical_sha256":"297c8972ebb33aa60026f72454ffc93a62523968fdec462451387f050fe82d42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:45.200604Z","signature_b64":"VqJxNymUH7HfM6josFwe5mhn9kG7BXA8iKa0XXMaHSK/VNEcyEF5LM7JJqllyyi7FJ0z3F+EVOF5xxxoqHfVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"297c8972ebb33aa60026f72454ffc93a62523968fdec462451387f050fe82d42","last_reissued_at":"2026-05-18T04:18:45.200029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:45.200029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0907.4764","source_version":2,"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:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IANZUTJlWo1pTZZOK7zMQCKwk+v3lG2cyEFP9+3NY8chdMm0FaT+IW5KeckWHjhyDkxAXGzZxnJddDsDAIPyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:25:43.942518Z"},"content_sha256":"75c8401c67b3b48578498e6e1bb27b2a1463319607aa888247046781b498b1e5","schema_version":"1.0","event_id":"sha256:75c8401c67b3b48578498e6e1bb27b2a1463319607aa888247046781b498b1e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:FF6IS4XLWM5KMABG64SFJ76JHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The monodromy pairing and discrete logarithm on the Jacobian of finite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.AG"],"primary_cat":"math.CO","authors_text":"Farbod Shokrieh","submitted_at":"2009-07-27T20:36:21Z","abstract_excerpt":"Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Jacobian group, and Picard group. The construction of this group closely mirrors the construction of the Jacobian variety of an algebraic curve. Motivated by this analogy, it was recently suggested by Norman Biggs that the critical group of a finite graph is a good candidate for doing discrete logarithm based cryptography. In this paper, we study a bilinear pairing on this group and show how to compute it. Then we use "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.4764","kind":"arxiv","version":2},"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:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"knghPk4IJFxBmwfoYFMOKv2V3V9xsXkF8v2fCojhY0ww21UBesWEhmf3/AYUtv6XXbLQTA/wQb5UTPcZOEsBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:25:43.943283Z"},"content_sha256":"b76493fc8082246722afd4d89797de7dab343b4bf8836d2df487a79b6330d6cf","schema_version":"1.0","event_id":"sha256:b76493fc8082246722afd4d89797de7dab343b4bf8836d2df487a79b6330d6cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FF6IS4XLWM5KMABG64SFJ76JHJ/bundle.json","state_url":"https://pith.science/pith/FF6IS4XLWM5KMABG64SFJ76JHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FF6IS4XLWM5KMABG64SFJ76JHJ/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-10T01:25:43Z","links":{"resolver":"https://pith.science/pith/FF6IS4XLWM5KMABG64SFJ76JHJ","bundle":"https://pith.science/pith/FF6IS4XLWM5KMABG64SFJ76JHJ/bundle.json","state":"https://pith.science/pith/FF6IS4XLWM5KMABG64SFJ76JHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FF6IS4XLWM5KMABG64SFJ76JHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:FF6IS4XLWM5KMABG64SFJ76JHJ","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":"ed23142023fad0b11d1a5319cc201f5ccef5900386a86f1269c8f807de5aaa81","cross_cats_sorted":["cs.CR","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-27T20:36:21Z","title_canon_sha256":"79ae47af80d17b4e0fd7ef6a079029d59f6dc2cc67862578d704f6d17eefaec0"},"schema_version":"1.0","source":{"id":"0907.4764","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.4764","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"0907.4764v2","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.4764","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"FF6IS4XLWM5K","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"FF6IS4XLWM5KMABG","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"FF6IS4XL","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:b76493fc8082246722afd4d89797de7dab343b4bf8836d2df487a79b6330d6cf","target":"graph","created_at":"2026-05-18T04:18:45Z","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":"Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Jacobian group, and Picard group. The construction of this group closely mirrors the construction of the Jacobian variety of an algebraic curve. Motivated by this analogy, it was recently suggested by Norman Biggs that the critical group of a finite graph is a good candidate for doing discrete logarithm based cryptography. In this paper, we study a bilinear pairing on this group and show how to compute it. Then we use ","authors_text":"Farbod Shokrieh","cross_cats":["cs.CR","math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-27T20:36:21Z","title":"The monodromy pairing and discrete logarithm on the Jacobian of finite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.4764","kind":"arxiv","version":2},"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:75c8401c67b3b48578498e6e1bb27b2a1463319607aa888247046781b498b1e5","target":"record","created_at":"2026-05-18T04:18:45Z","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":"ed23142023fad0b11d1a5319cc201f5ccef5900386a86f1269c8f807de5aaa81","cross_cats_sorted":["cs.CR","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-27T20:36:21Z","title_canon_sha256":"79ae47af80d17b4e0fd7ef6a079029d59f6dc2cc67862578d704f6d17eefaec0"},"schema_version":"1.0","source":{"id":"0907.4764","kind":"arxiv","version":2}},"canonical_sha256":"297c8972ebb33aa60026f72454ffc93a62523968fdec462451387f050fe82d42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"297c8972ebb33aa60026f72454ffc93a62523968fdec462451387f050fe82d42","first_computed_at":"2026-05-18T04:18:45.200029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:45.200029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VqJxNymUH7HfM6josFwe5mhn9kG7BXA8iKa0XXMaHSK/VNEcyEF5LM7JJqllyyi7FJ0z3F+EVOF5xxxoqHfVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:45.200604Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.4764","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75c8401c67b3b48578498e6e1bb27b2a1463319607aa888247046781b498b1e5","sha256:b76493fc8082246722afd4d89797de7dab343b4bf8836d2df487a79b6330d6cf"],"state_sha256":"97c370c3239ca27fabaf4c4670126f3b76b3d0865109bdb380672d00b68154c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7HcHBSaljFnk4ObOpd+OVRCkpTt6gnlTYVvLu44/tr4wp/uqydKvnc0BC9FhsvvIJ48UIpVdGIwk4QcMYCNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:25:43.947252Z","bundle_sha256":"96de394b5dc0c75ce9db42244e20921c32270d376d694977a6608e9895b55737"}}