{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PGGR3ADJOWOMOYZPRNDMXPX3HO","short_pith_number":"pith:PGGR3ADJ","canonical_record":{"source":{"id":"2607.27407","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T19:25:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3cb9cce3bace3351f6670b2098945da01925fb26f03fbd755d118e4e6178767b","abstract_canon_sha256":"96f1d942a2ef859a791c3792323aad406f421ea1e8833befe2c3120aff5e7abf"},"schema_version":"1.0"},"canonical_sha256":"798d1d8069759cc7632f8b46cbbefb3b8ec810077bc5186c128f569f5ba597de","source":{"kind":"arxiv","id":"2607.27407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27407","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27407v1","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27407","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"pith_short_12","alias_value":"PGGR3ADJOWOM","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGGR3ADJOWOMOYZP","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGGR3ADJ","created_at":"2026-07-31T00:11:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PGGR3ADJOWOMOYZPRNDMXPX3HO","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27407","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T19:25:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3cb9cce3bace3351f6670b2098945da01925fb26f03fbd755d118e4e6178767b","abstract_canon_sha256":"96f1d942a2ef859a791c3792323aad406f421ea1e8833befe2c3120aff5e7abf"},"schema_version":"1.0"},"canonical_sha256":"798d1d8069759cc7632f8b46cbbefb3b8ec810077bc5186c128f569f5ba597de","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"798d1d8069759cc7632f8b46cbbefb3b8ec810077bc5186c128f569f5ba597de","last_reissued_at":"2026-07-31T00:11:43.810202Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T00:11:43.810202Z"},"source_kind":"arxiv","source_id":"2607.27407","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-31T00:11:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aIxLo2Wvq6rHZkoetUXDj3VyC6eEHwVilUXIBmdWWGiL8yuLNto56UF/ir22J26Hm42seBXRSqUmdAESLRR1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:44:13.599845Z"},"content_sha256":"e5c5bb114747b58e0df31cace4d44ee5d9bc2eb020d0b78e0f325e1a7f64e5a2","schema_version":"1.0","event_id":"sha256:e5c5bb114747b58e0df31cace4d44ee5d9bc2eb020d0b78e0f325e1a7f64e5a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PGGR3ADJOWOMOYZPRNDMXPX3HO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On $\\varepsilon$-Matrix Product Factorization of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bobby Miraftab, Farzad Maghsoudi, Sho Suda","submitted_at":"2026-07-29T19:25:10Z","abstract_excerpt":"We introduce an approximate version of matrix product factorization for graphs. A simple graph $G$ on $n$ vertices is said to admit an $\\varepsilon$-matrix product factorization if there exist simple graphs $H$ and $K$ on the same vertex set such that $A(H)A(K)$ and $A(G)$ disagree in at most $\\varepsilon n^{2}$ entries. This Hamming-type relaxation preserves, outside the error set, the exact interpretation of each edge as having a unique $H$-then-$K$ two-step witness. We establish equivalent matrix, and witness formulations, showing that the sets $N_H(w)\\times N_K(w)$ form an approximate disj"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27407","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/2607.27407/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-31T00:11:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FvyUqy/GdrQOL9hyPfO93b3QgLZ9zMq8RHSf8ZiDyxLauwfZS8/sRK58Oxcv5krlhC9W7xrhk4F8v4RC5RpQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:44:13.600811Z"},"content_sha256":"992243c18c4fa6cd208c7a2bd2217e0a5323d65974f53d460e5cfd99c66cc4f3","schema_version":"1.0","event_id":"sha256:992243c18c4fa6cd208c7a2bd2217e0a5323d65974f53d460e5cfd99c66cc4f3"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:PGGR3ADJOWOMOYZPRNDMXPX3HO","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.disc.2016.07.018 resolves to 'On a construction using commuting regular graphs'. A reader following the printed text alone cannot reach it.","snippet":"Marius Somodi, Katie Burke, and Jesse Todd. On a construction using commuting regular graphs.Discrete Mathematics, 340(3):532–540, 2017.doi:10.1016/j.disc. 2016.07.018","arxiv_id":"2607.27407","detector":"doi_compliance","evidence":{"ref_index":14,"verdict_class":"incontrovertible","resolved_title":"On a construction using commuting regular graphs","printed_excerpt":"10.1016/j.disc","reconstructed_doi":"10.1016/j.disc.2016.07.018"},"severity":"advisory","ref_index":14,"audited_at":"2026-08-01T08:08:11.105910Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.disc.2016.07.018","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"663c9f0372c00d160dd6a0227b2f5701bef8103efe67f1fd9bf9a1c028780ec1","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"On a construction using commuting regular graphs","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15428,"payload_sha256":"86187eac9de86be8a05535e6c4623e6e1054e1183eba2fdd8e2510dbc8b1a3fb","signature_b64":"jNKf3NFO0n9VIFowXmr/5rGjy08n1WgFnyMorq+OEDnv8AyQjyzbDRnFeYWujKnNfMnhJShaBIFCjMffCPVZDg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T08:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"se7JC1IIZJ8tJ7HpT0MRqoxPSZ+/icW0NMHhc+QRQsQV7w0r1jZX/iOg1M99uPk3f545YMq88xdU+PD1FNdECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:44:13.629768Z"},"content_sha256":"5a127c6b7c95de6afe0c5487354097bb877447a2bcbdd9099331cd4b432f9f3c","schema_version":"1.0","event_id":"sha256:5a127c6b7c95de6afe0c5487354097bb877447a2bcbdd9099331cd4b432f9f3c"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:PGGR3ADJOWOMOYZPRNDMXPX3HO","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.laa.2025.09.011 resolves to 'On the factorability of infinite graphs'. A reader following the printed text alone cannot reach it.","snippet":"Babak Miraftab, Heydar Radjavi, and Sho Suda. On the factorability of infinite graphs.Linear Algebra and its Applications, 728:409–418, 2026.doi:10.1016/j.laa. 2025.09.011","arxiv_id":"2607.27407","detector":"doi_compliance","evidence":{"ref_index":11,"verdict_class":"incontrovertible","resolved_title":"On the factorability of infinite graphs","printed_excerpt":"10.1016/j.laa","reconstructed_doi":"10.1016/j.laa.2025.09.011"},"severity":"advisory","ref_index":11,"audited_at":"2026-08-01T08:08:11.105910Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.laa.2025.09.011","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a2e04bc65fdc8420980dbfd099a7aa66bad8701b62e8885cb34fdcd4674ca087","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"On the factorability of infinite graphs","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15427,"payload_sha256":"d6b548c2ce0d307b5d4574d4783d723e80efe01b8f08d634645c69548e6fc8e9","signature_b64":"cy8wJ4PmLEN5erC5+h7dWX1ekarCA3CuoOufnNlwUnuwL6RbY5Uojz944ds3uh2laA0pay7JKISUsKMe0ul0DA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T08:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xL/i3C+ChvFB34efwjFGq9KHki0xJ1KpmUXdDj3sBS00yTZN13Y7CfifDy2XwEogB8ZGKbUFsluuECGSM1VrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:44:13.630921Z"},"content_sha256":"0acdad59dd3ba2eb39348281fdb0412ae98c6867189d8e1c259fb7aa81d8cc6d","schema_version":"1.0","event_id":"sha256:0acdad59dd3ba2eb39348281fdb0412ae98c6867189d8e1c259fb7aa81d8cc6d"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:PGGR3ADJOWOMOYZPRNDMXPX3HO","target":"integrity","payload":{"note":"Identifier '10.17654/aadmjan2016_029_048' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"K. Arathi Bhat, K. Manjunatha Prasad, and G. Sudhakara. Some matrix equations of graphs.Advances and Applications in Discrete Mathematics, 17(1):29–48, 2016.doi: 10.17654/AADMJan2016_029_048","arxiv_id":"2607.27407","detector":"doi_compliance","evidence":{"doi":"10.17654/aadmjan2016_029_048","arxiv_id":null,"ref_index":5,"raw_excerpt":"K. Arathi Bhat, K. Manjunatha Prasad, and G. Sudhakara. Some matrix equations of graphs.Advances and Applications in Discrete Mathematics, 17(1):29–48, 2016.doi: 10.17654/AADMJan2016_029_048","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":5,"audited_at":"2026-08-01T08:08:11.105910Z","event_type":"pith.integrity.v1","detected_doi":"10.17654/aadmjan2016_029_048","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"49c57a9b2a3e8d8900e961efdab22f425530cfeb4bb812d6bca96aabeca34720","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15426,"payload_sha256":"ddf2e21330e947cfab771c335d782270a006043f16a925cffe6f44473e8a6090","signature_b64":"chTOHrthiLpGw1TWpaZwvdCM4FUTjI4JqnIbxkUBzs+d4WnRpM0tAFgenlNt5+tvhz9WmzTpiSxSUeTFNDxKBg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T08:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uq1GGPfb7V7IHcYCIl+y8R8AoJ6Xs4I3TfV6orlmi8Jid77wLAfM/ZsMbtr3BmniS5l/D5PaHpnVgNTnsbkbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:44:13.686617Z"},"content_sha256":"e2eadd2fb37914d8ecc7335edec11b8f894a47b76e47731c17a2dc66292688e4","schema_version":"1.0","event_id":"sha256:e2eadd2fb37914d8ecc7335edec11b8f894a47b76e47731c17a2dc66292688e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO/bundle.json","state_url":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO/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-08-14T07:44:13Z","links":{"resolver":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO","bundle":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO/bundle.json","state":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PGGR3ADJOWOMOYZPRNDMXPX3HO","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"96f1d942a2ef859a791c3792323aad406f421ea1e8833befe2c3120aff5e7abf","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T19:25:10Z","title_canon_sha256":"3cb9cce3bace3351f6670b2098945da01925fb26f03fbd755d118e4e6178767b"},"schema_version":"1.0","source":{"id":"2607.27407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27407","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27407v1","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27407","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"pith_short_12","alias_value":"PGGR3ADJOWOM","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGGR3ADJOWOMOYZP","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGGR3ADJ","created_at":"2026-07-31T00:11:43Z"}],"graph_snapshots":[{"event_id":"sha256:992243c18c4fa6cd208c7a2bd2217e0a5323d65974f53d460e5cfd99c66cc4f3","target":"graph","created_at":"2026-07-31T00:11:43Z","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/2607.27407/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce an approximate version of matrix product factorization for graphs. A simple graph $G$ on $n$ vertices is said to admit an $\\varepsilon$-matrix product factorization if there exist simple graphs $H$ and $K$ on the same vertex set such that $A(H)A(K)$ and $A(G)$ disagree in at most $\\varepsilon n^{2}$ entries. This Hamming-type relaxation preserves, outside the error set, the exact interpretation of each edge as having a unique $H$-then-$K$ two-step witness. We establish equivalent matrix, and witness formulations, showing that the sets $N_H(w)\\times N_K(w)$ form an approximate disj","authors_text":"Bobby Miraftab, Farzad Maghsoudi, Sho Suda","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T19:25:10Z","title":"On $\\varepsilon$-Matrix Product Factorization of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27407","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:e5c5bb114747b58e0df31cace4d44ee5d9bc2eb020d0b78e0f325e1a7f64e5a2","target":"record","created_at":"2026-07-31T00:11:43Z","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":"96f1d942a2ef859a791c3792323aad406f421ea1e8833befe2c3120aff5e7abf","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T19:25:10Z","title_canon_sha256":"3cb9cce3bace3351f6670b2098945da01925fb26f03fbd755d118e4e6178767b"},"schema_version":"1.0","source":{"id":"2607.27407","kind":"arxiv","version":1}},"canonical_sha256":"798d1d8069759cc7632f8b46cbbefb3b8ec810077bc5186c128f569f5ba597de","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"798d1d8069759cc7632f8b46cbbefb3b8ec810077bc5186c128f569f5ba597de","first_computed_at":"2026-07-31T00:11:43.810202Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T00:11:43.810202Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27407","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:0acdad59dd3ba2eb39348281fdb0412ae98c6867189d8e1c259fb7aa81d8cc6d","sha256:5a127c6b7c95de6afe0c5487354097bb877447a2bcbdd9099331cd4b432f9f3c","sha256:e2eadd2fb37914d8ecc7335edec11b8f894a47b76e47731c17a2dc66292688e4"]}],"invalid_events":[],"applied_event_ids":["sha256:e5c5bb114747b58e0df31cace4d44ee5d9bc2eb020d0b78e0f325e1a7f64e5a2","sha256:992243c18c4fa6cd208c7a2bd2217e0a5323d65974f53d460e5cfd99c66cc4f3"],"state_sha256":"e58309e32c31a9a5f3d5ac2c734826f84475c441a8fccd4ee591438742c16587"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAH2xIuAZUJoRbWrUzHIymJr/UOkfzv9s5xkVFLwNVJRbAncDisnV5atZnRd0nydal7TaSeStS3kmyRkoXzfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T07:44:13.711462Z","bundle_sha256":"18db6209c1fdf014e9c03f86b8913874d2bd31ce137cc82087468db355632eb7"}}