{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2POKP3P7YEYNMCJX25EJAAWNF6","short_pith_number":"pith:2POKP3P7","canonical_record":{"source":{"id":"2607.14834","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T10:56:51Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"e46fe7b1b8139b9430b6386c6c98215f1b549e23c08ff0a9652f6ba040c82703","abstract_canon_sha256":"00b563aae54659aa5038147a596e227909bf641fe23a10a22534d6961c47d752"},"schema_version":"1.0"},"canonical_sha256":"d3dca7edffc130d60937d7489002cd2f86b18bec0b398403680fbffbb28f22b7","source":{"kind":"arxiv","id":"2607.14834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14834","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14834v1","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14834","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"2POKP3P7YEYN","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"pith_short_16","alias_value":"2POKP3P7YEYNMCJX","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"pith_short_8","alias_value":"2POKP3P7","created_at":"2026-07-17T01:21:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2POKP3P7YEYNMCJX25EJAAWNF6","target":"record","payload":{"canonical_record":{"source":{"id":"2607.14834","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T10:56:51Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"e46fe7b1b8139b9430b6386c6c98215f1b549e23c08ff0a9652f6ba040c82703","abstract_canon_sha256":"00b563aae54659aa5038147a596e227909bf641fe23a10a22534d6961c47d752"},"schema_version":"1.0"},"canonical_sha256":"d3dca7edffc130d60937d7489002cd2f86b18bec0b398403680fbffbb28f22b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:21:33.518299Z","signature_b64":"d2HRAapUjgb9sM3gp/hUbPicL2aBncSZUY1rsRorGVv0aen53Ksw/MCbqnxZsdomwtl2aCTad8YSOHkAwcbCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3dca7edffc130d60937d7489002cd2f86b18bec0b398403680fbffbb28f22b7","last_reissued_at":"2026-07-17T01:21:33.517456Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:21:33.517456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.14834","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-17T01:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQQcN/z6rzX62u9dN3CEJDoQQozI/CiQoDIJKv9VpB4KJGNMqmFvJODSHLsteMZPBT3hBHxNruoqG2kdmb83Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:53:33.999972Z"},"content_sha256":"f0b8af779027dd14534f4f04a5bbdde620a1d92efefce462ebff972ae9126893","schema_version":"1.0","event_id":"sha256:f0b8af779027dd14534f4f04a5bbdde620a1d92efefce462ebff972ae9126893"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2POKP3P7YEYNMCJX25EJAAWNF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lossy compression of weighted graph adjacency matrices by transform coding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Antonio Ortega, Hiroshi Higashi, Junya Hara, Kenta Yanagiya, Yuichi Tanaka","submitted_at":"2026-07-16T10:56:51Z","abstract_excerpt":"In this paper, we propose a compression framework for weighted graphs in which the graph topology is transmitted losslessly and edge weights are compressed lossily. A challenge in the lossy compression of edge weights is that the underlying relationships between edges are ambiguous. To address this issue, we first transform the unweighted graph into the corresponding line graph, whose nodes represent the edges of the original graph and whose edges encode the relationships between them. The line graph transform allows us to regard edge weights as a graph signal defined on the line graph. Instea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14834","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.14834/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-17T01:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hV2v0fp4yXd8d1ev/VnQCHNoH2XmuLnfz99Hl+m1nk+PJ96+OdQSBUrgSXhYliVgZLVIMXwPNDgyb0VAVvkyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:53:34.000873Z"},"content_sha256":"f296b783d0f0e76037d935517e4820b9982f250a202d16bcfee11641df8893ba","schema_version":"1.0","event_id":"sha256:f296b783d0f0e76037d935517e4820b9982f250a202d16bcfee11641df8893ba"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:2POKP3P7YEYNMCJX25EJAAWNF6","target":"integrity","payload":{"note":"Identifier '10.1109/tsipn.2016.25' 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":"A. Sakiyama, K. Watanabe, and Y. Tanaka, “Spectral Grap h Wavelets and Filter Banks With Low Approximation Error”, IEEE Trans. Signal Inf. Process. Netw., 2(3), 2016, 230–45, doi: 10.1109/TSIPN.2016.25","arxiv_id":"2607.14834","detector":"doi_compliance","evidence":{"doi":"10.1109/tsipn.2016.25","arxiv_id":null,"ref_index":34,"raw_excerpt":"A. Sakiyama, K. Watanabe, and Y. Tanaka, “Spectral Grap h Wavelets and Filter Banks With Low Approximation Error”, IEEE Trans. Signal Inf. Process. Netw., 2(3), 2016, 230–45, doi: 10.1109/TSIPN.2016.25","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":34,"audited_at":"2026-08-02T01:10:29.625088Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/tsipn.2016.25","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"ba59e901208327074565a5e20566607b3e3266aff5a485417cc85665d87839e2","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":16954,"payload_sha256":"4c438316ce2a69cdcc648897249865c494dafbefd7ea4d368536bf602e13bf4a","signature_b64":"irewj1IlL7BoSCBa0Qd5R+5fBuK3gn0qYeABnnm+TM9bQVoGmXIBBjwWgfAGYYePcnF1LyXYE5hphPaI4lQpDQ==","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-02T01:13:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4SjVQ69z2HMkd5a083RW8iLoyPrWZXeMa4bGM1kL4sl7d9oHG2JyDjO3YJAwNdDgNIp2s5q5eeEdGqP+wxfRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:53:34.005401Z"},"content_sha256":"c2fc45e633e37c3d5518fe14bb544b8d7b41b4c25af94eeb7c010b23e4047276","schema_version":"1.0","event_id":"sha256:c2fc45e633e37c3d5518fe14bb544b8d7b41b4c25af94eeb7c010b23e4047276"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:2POKP3P7YEYNMCJX25EJAAWNF6","target":"integrity","payload":{"note":"Identifier '10.1109/tsp.2019.29' 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":"A. Sakiyama, Y. Tanaka, T. Tanaka, and A. Ortega, “Eigen- decomposition Free Sampling Set Selection for Graph Signal s”, IEEE Trans. Signal Process., 67(10), 2019, 2679–92, doi: 10.1109/TSP.2019.29","arxiv_id":"2607.14834","detector":"doi_compliance","evidence":{"doi":"10.1109/tsp.2019.29","arxiv_id":null,"ref_index":7,"raw_excerpt":"A. Sakiyama, Y. Tanaka, T. Tanaka, and A. Ortega, “Eigen- decomposition Free Sampling Set Selection for Graph Signal s”, IEEE Trans. Signal Process., 67(10), 2019, 2679–92, doi: 10.1109/TSP.2019.29","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":7,"audited_at":"2026-08-02T01:10:29.625088Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/tsp.2019.29","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"26d5778aca8b07ce55b06b9e6b601913a7f37f03dc2dabadf59968ec886c99ff","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":16953,"payload_sha256":"87fb26870899acdcdbadb2df1b5f7b2b87adeae34824fc455f33923bd60446c9","signature_b64":"kZVvJRBmR8B1BrwolJ8tZrJjUWQoN+KtoIYekMWSNUhe1YnTio7p040nPYWijPMvwuQdgdAQYipK0ANP0whkAA==","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-02T01:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iW9tL3EU2U91xdLXYaYr9IBoikFh72VZ/ZS91q1yHJ3K3/9dnRZYowL1MeV2cr33gFjVQVh62BvyVJuoiZ0ADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:53:34.006245Z"},"content_sha256":"b85b0747098777fca83b559fb9b884df38c16f79c81970c234760fe25e36708b","schema_version":"1.0","event_id":"sha256:b85b0747098777fca83b559fb9b884df38c16f79c81970c234760fe25e36708b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2POKP3P7YEYNMCJX25EJAAWNF6/bundle.json","state_url":"https://pith.science/pith/2POKP3P7YEYNMCJX25EJAAWNF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2POKP3P7YEYNMCJX25EJAAWNF6/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-06T22:53:34Z","links":{"resolver":"https://pith.science/pith/2POKP3P7YEYNMCJX25EJAAWNF6","bundle":"https://pith.science/pith/2POKP3P7YEYNMCJX25EJAAWNF6/bundle.json","state":"https://pith.science/pith/2POKP3P7YEYNMCJX25EJAAWNF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2POKP3P7YEYNMCJX25EJAAWNF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2POKP3P7YEYNMCJX25EJAAWNF6","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"00b563aae54659aa5038147a596e227909bf641fe23a10a22534d6961c47d752","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T10:56:51Z","title_canon_sha256":"e46fe7b1b8139b9430b6386c6c98215f1b549e23c08ff0a9652f6ba040c82703"},"schema_version":"1.0","source":{"id":"2607.14834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14834","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14834v1","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14834","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"2POKP3P7YEYN","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"pith_short_16","alias_value":"2POKP3P7YEYNMCJX","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"pith_short_8","alias_value":"2POKP3P7","created_at":"2026-07-17T01:21:33Z"}],"graph_snapshots":[{"event_id":"sha256:f296b783d0f0e76037d935517e4820b9982f250a202d16bcfee11641df8893ba","target":"graph","created_at":"2026-07-17T01:21:33Z","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.14834/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a compression framework for weighted graphs in which the graph topology is transmitted losslessly and edge weights are compressed lossily. A challenge in the lossy compression of edge weights is that the underlying relationships between edges are ambiguous. To address this issue, we first transform the unweighted graph into the corresponding line graph, whose nodes represent the edges of the original graph and whose edges encode the relationships between them. The line graph transform allows us to regard edge weights as a graph signal defined on the line graph. Instea","authors_text":"Antonio Ortega, Hiroshi Higashi, Junya Hara, Kenta Yanagiya, Yuichi Tanaka","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T10:56:51Z","title":"Lossy compression of weighted graph adjacency matrices by transform coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14834","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:f0b8af779027dd14534f4f04a5bbdde620a1d92efefce462ebff972ae9126893","target":"record","created_at":"2026-07-17T01:21:33Z","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":"00b563aae54659aa5038147a596e227909bf641fe23a10a22534d6961c47d752","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T10:56:51Z","title_canon_sha256":"e46fe7b1b8139b9430b6386c6c98215f1b549e23c08ff0a9652f6ba040c82703"},"schema_version":"1.0","source":{"id":"2607.14834","kind":"arxiv","version":1}},"canonical_sha256":"d3dca7edffc130d60937d7489002cd2f86b18bec0b398403680fbffbb28f22b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3dca7edffc130d60937d7489002cd2f86b18bec0b398403680fbffbb28f22b7","first_computed_at":"2026-07-17T01:21:33.517456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-17T01:21:33.517456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d2HRAapUjgb9sM3gp/hUbPicL2aBncSZUY1rsRorGVv0aen53Ksw/MCbqnxZsdomwtl2aCTad8YSOHkAwcbCAw==","signature_status":"signed_v1","signed_at":"2026-07-17T01:21:33.518299Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.14834","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:b85b0747098777fca83b559fb9b884df38c16f79c81970c234760fe25e36708b","sha256:c2fc45e633e37c3d5518fe14bb544b8d7b41b4c25af94eeb7c010b23e4047276"]}],"invalid_events":[],"applied_event_ids":["sha256:f0b8af779027dd14534f4f04a5bbdde620a1d92efefce462ebff972ae9126893","sha256:f296b783d0f0e76037d935517e4820b9982f250a202d16bcfee11641df8893ba"],"state_sha256":"1bacc4186e938bc4ddc12d3da35555ec67245346b6472f015bd52c2baf4a5686"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4eAex+TiunFWcIkAn4DtYeZxWHR/Cax1OkKQMy9VU9cMjTDZP3InzStkDAUtv+6+XO7QFbbBEyB/3X4Y8AkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T22:53:34.011107Z","bundle_sha256":"574621ff13043ff034f7d6a675c1c408ac4e1054cd78d56ebc7ae1f5f0c0b5cd"}}