{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LGNNVCZEWLQBEGN2J3I6ALKVBC","short_pith_number":"pith:LGNNVCZE","canonical_record":{"source":{"id":"2505.14249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2025-05-20T12:02:36Z","cross_cats_sorted":[],"title_canon_sha256":"677f7faaf0ff44dc08b4df83718ccf7b6b7cef1f1a52ce1fee6355340c7819f9","abstract_canon_sha256":"c8330e05319ca483b99465b3f05a31f22b50f0047ef80c4e8d51a2699077ab42"},"schema_version":"1.0"},"canonical_sha256":"599ada8b24b2e01219ba4ed1e02d5508b49d5fd8138abc21cb37a7e7e1156f45","source":{"kind":"arxiv","id":"2505.14249","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.14249","created_at":"2026-07-05T11:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2505.14249v1","created_at":"2026-07-05T11:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14249","created_at":"2026-07-05T11:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"LGNNVCZEWLQB","created_at":"2026-07-05T11:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"LGNNVCZEWLQBEGN2","created_at":"2026-07-05T11:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"LGNNVCZE","created_at":"2026-07-05T11:05:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LGNNVCZEWLQBEGN2J3I6ALKVBC","target":"record","payload":{"canonical_record":{"source":{"id":"2505.14249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2025-05-20T12:02:36Z","cross_cats_sorted":[],"title_canon_sha256":"677f7faaf0ff44dc08b4df83718ccf7b6b7cef1f1a52ce1fee6355340c7819f9","abstract_canon_sha256":"c8330e05319ca483b99465b3f05a31f22b50f0047ef80c4e8d51a2699077ab42"},"schema_version":"1.0"},"canonical_sha256":"599ada8b24b2e01219ba4ed1e02d5508b49d5fd8138abc21cb37a7e7e1156f45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:58.424663Z","signature_b64":"CmgMWJGdeWIPPIIQThYkxVBmj0a6Z3gWMELKmNqrT4mCUR+lIk/xzOy+iJBxaW/rg0N63i+QMgS9X8Z11xSNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"599ada8b24b2e01219ba4ed1e02d5508b49d5fd8138abc21cb37a7e7e1156f45","last_reissued_at":"2026-07-05T11:05:58.424250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:58.424250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.14249","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-07-05T11:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1J2ZJ6lYIzzIXwA+p7K3pMpV0o9f5N/iRgOr3mp6MnPvF3l64mkGRf3cxYcPSLYo5IxX3M+RwQzQ7H5pHI6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:04:23.748661Z"},"content_sha256":"c3bbb618a71b1980eec3cbc6f1b5f706cbb66b07459e22ee2e0f35d012f4256c","schema_version":"1.0","event_id":"sha256:c3bbb618a71b1980eec3cbc6f1b5f706cbb66b07459e22ee2e0f35d012f4256c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LGNNVCZEWLQBEGN2J3I6ALKVBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clean Graphs and Idempotent Graphs over Finite Rings: An Approach Based on Z_n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Felicia Servina Djuang, Indah Emilia Wijayanti, Yeni Susanti","submitted_at":"2025-05-20T12:02:36Z","abstract_excerpt":"Let $R$ be a finite ring with identity. The idempotent graph $I(R)$ is the graph whose vertex set consists of the non-trivial idempotent elements of $R$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx = 0$. The clean graph $Cl(R)$ is a graph whose vertices are of the form $(e, u)$, where $e$ is an idempotent element and $u$ is a unit of $R$. Two distinct vertices $(e,u)$ and $(f, v)$ are adjacent if and only if $ef = fe = 0$ or $uv = vu = 1$. The graph $Cl_2(R)$ is the subgraph of $Cl(R)$ induced by the set $\\{(e, u) : e \\text{ is a nonzero idempotent element of }"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14249","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.14249/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gaoxvDYh5vZFtn/PkgI+GcMu01NZ0/U8OJPkE79Zb1PQAGDx2302PLbKem2Iw7EkfwRi3PPwHl719S85XeDICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:04:23.749298Z"},"content_sha256":"d9fb3e842f44c6c3328617f9bc0e973fcd16226e2ce51b14f16679f88c1f03e0","schema_version":"1.0","event_id":"sha256:d9fb3e842f44c6c3328617f9bc0e973fcd16226e2ce51b14f16679f88c1f03e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGNNVCZEWLQBEGN2J3I6ALKVBC/bundle.json","state_url":"https://pith.science/pith/LGNNVCZEWLQBEGN2J3I6ALKVBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGNNVCZEWLQBEGN2J3I6ALKVBC/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-06T15:04:23Z","links":{"resolver":"https://pith.science/pith/LGNNVCZEWLQBEGN2J3I6ALKVBC","bundle":"https://pith.science/pith/LGNNVCZEWLQBEGN2J3I6ALKVBC/bundle.json","state":"https://pith.science/pith/LGNNVCZEWLQBEGN2J3I6ALKVBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGNNVCZEWLQBEGN2J3I6ALKVBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LGNNVCZEWLQBEGN2J3I6ALKVBC","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":"c8330e05319ca483b99465b3f05a31f22b50f0047ef80c4e8d51a2699077ab42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2025-05-20T12:02:36Z","title_canon_sha256":"677f7faaf0ff44dc08b4df83718ccf7b6b7cef1f1a52ce1fee6355340c7819f9"},"schema_version":"1.0","source":{"id":"2505.14249","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.14249","created_at":"2026-07-05T11:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2505.14249v1","created_at":"2026-07-05T11:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14249","created_at":"2026-07-05T11:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"LGNNVCZEWLQB","created_at":"2026-07-05T11:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"LGNNVCZEWLQBEGN2","created_at":"2026-07-05T11:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"LGNNVCZE","created_at":"2026-07-05T11:05:58Z"}],"graph_snapshots":[{"event_id":"sha256:d9fb3e842f44c6c3328617f9bc0e973fcd16226e2ce51b14f16679f88c1f03e0","target":"graph","created_at":"2026-07-05T11:05:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.14249/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $R$ be a finite ring with identity. The idempotent graph $I(R)$ is the graph whose vertex set consists of the non-trivial idempotent elements of $R$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx = 0$. The clean graph $Cl(R)$ is a graph whose vertices are of the form $(e, u)$, where $e$ is an idempotent element and $u$ is a unit of $R$. Two distinct vertices $(e,u)$ and $(f, v)$ are adjacent if and only if $ef = fe = 0$ or $uv = vu = 1$. The graph $Cl_2(R)$ is the subgraph of $Cl(R)$ induced by the set $\\{(e, u) : e \\text{ is a nonzero idempotent element of }","authors_text":"Felicia Servina Djuang, Indah Emilia Wijayanti, Yeni Susanti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2025-05-20T12:02:36Z","title":"Clean Graphs and Idempotent Graphs over Finite Rings: An Approach Based on Z_n"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14249","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:c3bbb618a71b1980eec3cbc6f1b5f706cbb66b07459e22ee2e0f35d012f4256c","target":"record","created_at":"2026-07-05T11:05:58Z","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":"c8330e05319ca483b99465b3f05a31f22b50f0047ef80c4e8d51a2699077ab42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2025-05-20T12:02:36Z","title_canon_sha256":"677f7faaf0ff44dc08b4df83718ccf7b6b7cef1f1a52ce1fee6355340c7819f9"},"schema_version":"1.0","source":{"id":"2505.14249","kind":"arxiv","version":1}},"canonical_sha256":"599ada8b24b2e01219ba4ed1e02d5508b49d5fd8138abc21cb37a7e7e1156f45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"599ada8b24b2e01219ba4ed1e02d5508b49d5fd8138abc21cb37a7e7e1156f45","first_computed_at":"2026-07-05T11:05:58.424250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:05:58.424250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CmgMWJGdeWIPPIIQThYkxVBmj0a6Z3gWMELKmNqrT4mCUR+lIk/xzOy+iJBxaW/rg0N63i+QMgS9X8Z11xSNAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:05:58.424663Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.14249","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3bbb618a71b1980eec3cbc6f1b5f706cbb66b07459e22ee2e0f35d012f4256c","sha256:d9fb3e842f44c6c3328617f9bc0e973fcd16226e2ce51b14f16679f88c1f03e0"],"state_sha256":"b54b7c7075bd48f00200ca7ffca628418243cc59c35e0b2c13fe2c278717194b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RgxU9orxUabRSbnfKRyCXjHaEA1fFwASapdMuwg1+P6lFP6YmSVEeR/bfc+hp8ZmT99/WeGrfu5vzkjOpxSHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:04:23.751368Z","bundle_sha256":"33df11bd63a7507530a231ee5fa85a35a1d42146f7c17e4fb3558e7e3f235e08"}}