{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DBHHWAUGULBTPCMMHB3UCZGW3V","short_pith_number":"pith:DBHHWAUG","canonical_record":{"source":{"id":"2410.10376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-10-14T11:01:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0d4c4596abf548fd856e9ca9ffc3ce421f9dbf01fb9f3c129bacfb8726919191","abstract_canon_sha256":"ec2f7b9147528e9e0ecfda2fc7660ea5d5e08f9d9c638576f574fc07f3b8a46b"},"schema_version":"1.0"},"canonical_sha256":"184e7b0286a2c337898c38774164d6dd5246fe64bbce2e8d318eb976271fa286","source":{"kind":"arxiv","id":"2410.10376","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.10376","created_at":"2026-07-05T09:20:15Z"},{"alias_kind":"arxiv_version","alias_value":"2410.10376v1","created_at":"2026-07-05T09:20:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10376","created_at":"2026-07-05T09:20:15Z"},{"alias_kind":"pith_short_12","alias_value":"DBHHWAUGULBT","created_at":"2026-07-05T09:20:15Z"},{"alias_kind":"pith_short_16","alias_value":"DBHHWAUGULBTPCMM","created_at":"2026-07-05T09:20:15Z"},{"alias_kind":"pith_short_8","alias_value":"DBHHWAUG","created_at":"2026-07-05T09:20:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DBHHWAUGULBTPCMMHB3UCZGW3V","target":"record","payload":{"canonical_record":{"source":{"id":"2410.10376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-10-14T11:01:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0d4c4596abf548fd856e9ca9ffc3ce421f9dbf01fb9f3c129bacfb8726919191","abstract_canon_sha256":"ec2f7b9147528e9e0ecfda2fc7660ea5d5e08f9d9c638576f574fc07f3b8a46b"},"schema_version":"1.0"},"canonical_sha256":"184e7b0286a2c337898c38774164d6dd5246fe64bbce2e8d318eb976271fa286","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:15.362915Z","signature_b64":"UAxy9/Ss64jJ72vJXpXTyJFgl5mqPQD++z8vc5YxW10DS73q05cdT4lzTOe9AgVqhDVKO0ZhZH/x7CjSnDlLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"184e7b0286a2c337898c38774164d6dd5246fe64bbce2e8d318eb976271fa286","last_reissued_at":"2026-07-05T09:20:15.362477Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:15.362477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.10376","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-05T09:20:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4rsCv26mAn0lotKS9YSuxJrgE0ik2yXSqBhelyS7N40WvFM69UBB50Z1S6mP/pX4RJa1SfZwD9Qw4hHy9kwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:32:41.894096Z"},"content_sha256":"d1ebb4699b66e6a201be2645ab80307cd42b6d5d48de72181d6ba3d277d2aad4","schema_version":"1.0","event_id":"sha256:d1ebb4699b66e6a201be2645ab80307cd42b6d5d48de72181d6ba3d277d2aad4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DBHHWAUGULBTPCMMHB3UCZGW3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing eulerian magnitude homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Giuliamaria Menara, Luca Manzoni","submitted_at":"2024-10-14T11:01:33Z","abstract_excerpt":"In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first diagonal algorithm, a breadth-first-search-based algorithm parameterized by the diameter of the graph to calculate the ranks of the homology groups of interest. To do this, we leverage the close relationship between the combinatorics of the homology boundary map and the substructures appearing in the graph. We then discuss the feasibility of the presented algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10376","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/2410.10376/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-05T09:20:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dh8fox3wYIiWmtppnzqlBAMtH3UYg6fslbNr0RGJWb4n+1pwVUFg6/IcgQZKy0BlC2cm9z0ad+uIsNG10+dCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:32:41.894610Z"},"content_sha256":"bb4d983407ba693dfa3b3e8c1e05da2e60a08b3779f7b396c5853cfd24e40ed3","schema_version":"1.0","event_id":"sha256:bb4d983407ba693dfa3b3e8c1e05da2e60a08b3779f7b396c5853cfd24e40ed3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBHHWAUGULBTPCMMHB3UCZGW3V/bundle.json","state_url":"https://pith.science/pith/DBHHWAUGULBTPCMMHB3UCZGW3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBHHWAUGULBTPCMMHB3UCZGW3V/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-04T05:32:41Z","links":{"resolver":"https://pith.science/pith/DBHHWAUGULBTPCMMHB3UCZGW3V","bundle":"https://pith.science/pith/DBHHWAUGULBTPCMMHB3UCZGW3V/bundle.json","state":"https://pith.science/pith/DBHHWAUGULBTPCMMHB3UCZGW3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBHHWAUGULBTPCMMHB3UCZGW3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DBHHWAUGULBTPCMMHB3UCZGW3V","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":"ec2f7b9147528e9e0ecfda2fc7660ea5d5e08f9d9c638576f574fc07f3b8a46b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-10-14T11:01:33Z","title_canon_sha256":"0d4c4596abf548fd856e9ca9ffc3ce421f9dbf01fb9f3c129bacfb8726919191"},"schema_version":"1.0","source":{"id":"2410.10376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.10376","created_at":"2026-07-05T09:20:15Z"},{"alias_kind":"arxiv_version","alias_value":"2410.10376v1","created_at":"2026-07-05T09:20:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10376","created_at":"2026-07-05T09:20:15Z"},{"alias_kind":"pith_short_12","alias_value":"DBHHWAUGULBT","created_at":"2026-07-05T09:20:15Z"},{"alias_kind":"pith_short_16","alias_value":"DBHHWAUGULBTPCMM","created_at":"2026-07-05T09:20:15Z"},{"alias_kind":"pith_short_8","alias_value":"DBHHWAUG","created_at":"2026-07-05T09:20:15Z"}],"graph_snapshots":[{"event_id":"sha256:bb4d983407ba693dfa3b3e8c1e05da2e60a08b3779f7b396c5853cfd24e40ed3","target":"graph","created_at":"2026-07-05T09:20:15Z","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/2410.10376/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first diagonal algorithm, a breadth-first-search-based algorithm parameterized by the diameter of the graph to calculate the ranks of the homology groups of interest. To do this, we leverage the close relationship between the combinatorics of the homology boundary map and the substructures appearing in the graph. We then discuss the feasibility of the presented algorit","authors_text":"Giuliamaria Menara, Luca Manzoni","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-10-14T11:01:33Z","title":"Computing eulerian magnitude homology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10376","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:d1ebb4699b66e6a201be2645ab80307cd42b6d5d48de72181d6ba3d277d2aad4","target":"record","created_at":"2026-07-05T09:20:15Z","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":"ec2f7b9147528e9e0ecfda2fc7660ea5d5e08f9d9c638576f574fc07f3b8a46b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-10-14T11:01:33Z","title_canon_sha256":"0d4c4596abf548fd856e9ca9ffc3ce421f9dbf01fb9f3c129bacfb8726919191"},"schema_version":"1.0","source":{"id":"2410.10376","kind":"arxiv","version":1}},"canonical_sha256":"184e7b0286a2c337898c38774164d6dd5246fe64bbce2e8d318eb976271fa286","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"184e7b0286a2c337898c38774164d6dd5246fe64bbce2e8d318eb976271fa286","first_computed_at":"2026-07-05T09:20:15.362477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:20:15.362477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UAxy9/Ss64jJ72vJXpXTyJFgl5mqPQD++z8vc5YxW10DS73q05cdT4lzTOe9AgVqhDVKO0ZhZH/x7CjSnDlLBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:20:15.362915Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.10376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1ebb4699b66e6a201be2645ab80307cd42b6d5d48de72181d6ba3d277d2aad4","sha256:bb4d983407ba693dfa3b3e8c1e05da2e60a08b3779f7b396c5853cfd24e40ed3"],"state_sha256":"81d46da5aaa6c1ce0466e3655463074fd6e136c2cf8d8f99f5e77d24eac0d525"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BwtnXcUmrA4nP94DDa4QCiBiTYmIpkZoIna5sjDDaCyOChm/5fStW72trf0C7sd+HUvq2iffUod7JKYaKYyVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T05:32:41.900153Z","bundle_sha256":"ce44a79c5f365c2ecc8018dfea465344bc4d61d2ae381b48746a379f4eb718d9"}}