{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SJ3QI4QOI47M27KCYTYKUCGRJV","short_pith_number":"pith:SJ3QI4QO","canonical_record":{"source":{"id":"1201.4459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-21T10:39:34Z","cross_cats_sorted":[],"title_canon_sha256":"21d3ddf0b67dc28a2a4a69a7eddf9609c2a053d84afea3d07bd90b605042a642","abstract_canon_sha256":"c80200050313b038a6a1eb15ce3051a8ec2c6aacab94e07de8755e4ef5276577"},"schema_version":"1.0"},"canonical_sha256":"927704720e473ecd7d42c4f0aa08d14d54bd9d38c95fd699ed97b33f325c3c30","source":{"kind":"arxiv","id":"1201.4459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4459","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4459v1","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4459","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"SJ3QI4QOI47M","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SJ3QI4QOI47M27KC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SJ3QI4QO","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SJ3QI4QOI47M27KCYTYKUCGRJV","target":"record","payload":{"canonical_record":{"source":{"id":"1201.4459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-21T10:39:34Z","cross_cats_sorted":[],"title_canon_sha256":"21d3ddf0b67dc28a2a4a69a7eddf9609c2a053d84afea3d07bd90b605042a642","abstract_canon_sha256":"c80200050313b038a6a1eb15ce3051a8ec2c6aacab94e07de8755e4ef5276577"},"schema_version":"1.0"},"canonical_sha256":"927704720e473ecd7d42c4f0aa08d14d54bd9d38c95fd699ed97b33f325c3c30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:05.997089Z","signature_b64":"LHVQ/ktWZ7Je4JMOatdNo6anoAqk6WSbGYIH3YcuVvosuXtumFWMphJg0+qcCmsCTj/DydiApkSdLHErzs6QAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"927704720e473ecd7d42c4f0aa08d14d54bd9d38c95fd699ed97b33f325c3c30","last_reissued_at":"2026-05-18T04:04:05.996493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:05.996493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.4459","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-05-18T04:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"veDstlCwt2LC9qG3rACDhvA40Ws9Ra/F2rOYJx+XYEInqIe30JB4tbCWvp3EUbshwBy4NXz1dy0qycKyc1XXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T17:29:25.183276Z"},"content_sha256":"37ceb9bb50e1782b878094e806f3be560f89518e9948b3e724ebcb68a3a91eb4","schema_version":"1.0","event_id":"sha256:37ceb9bb50e1782b878094e806f3be560f89518e9948b3e724ebcb68a3a91eb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SJ3QI4QOI47M27KCYTYKUCGRJV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient parallel algorithm for the longest path problem in meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alireza Bagheri, Fatemeh Keshavarz-Kohjerdi","submitted_at":"2012-01-21T10:39:34Z","abstract_excerpt":"In this paper, first we give a sequential linear-time algorithm for the longest path problem in meshes. This algorithm can be considered as an improvement of [13]. Then based on this sequential algorithm, we present a constant-time parallel algorithm for the problem which can be run on every parallel machine."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4459","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":""},"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:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxT1q01bZfDBqRmWz6U79EwVnzdb3cOduv+ghfod1mETd9Dve1S2SGGYFmSQ8adtL7BEcGk7M1Bzr5qmFLjqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T17:29:25.183636Z"},"content_sha256":"80c2302c46e98b7fd582a80aad333f70fbb526db387f1fd24c5aedd94dbd199e","schema_version":"1.0","event_id":"sha256:80c2302c46e98b7fd582a80aad333f70fbb526db387f1fd24c5aedd94dbd199e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJ3QI4QOI47M27KCYTYKUCGRJV/bundle.json","state_url":"https://pith.science/pith/SJ3QI4QOI47M27KCYTYKUCGRJV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJ3QI4QOI47M27KCYTYKUCGRJV/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-20T17:29:25Z","links":{"resolver":"https://pith.science/pith/SJ3QI4QOI47M27KCYTYKUCGRJV","bundle":"https://pith.science/pith/SJ3QI4QOI47M27KCYTYKUCGRJV/bundle.json","state":"https://pith.science/pith/SJ3QI4QOI47M27KCYTYKUCGRJV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJ3QI4QOI47M27KCYTYKUCGRJV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SJ3QI4QOI47M27KCYTYKUCGRJV","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":"c80200050313b038a6a1eb15ce3051a8ec2c6aacab94e07de8755e4ef5276577","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-21T10:39:34Z","title_canon_sha256":"21d3ddf0b67dc28a2a4a69a7eddf9609c2a053d84afea3d07bd90b605042a642"},"schema_version":"1.0","source":{"id":"1201.4459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4459","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4459v1","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4459","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"SJ3QI4QOI47M","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SJ3QI4QOI47M27KC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SJ3QI4QO","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:80c2302c46e98b7fd582a80aad333f70fbb526db387f1fd24c5aedd94dbd199e","target":"graph","created_at":"2026-05-18T04:04:05Z","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":"In this paper, first we give a sequential linear-time algorithm for the longest path problem in meshes. This algorithm can be considered as an improvement of [13]. Then based on this sequential algorithm, we present a constant-time parallel algorithm for the problem which can be run on every parallel machine.","authors_text":"Alireza Bagheri, Fatemeh Keshavarz-Kohjerdi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-21T10:39:34Z","title":"An efficient parallel algorithm for the longest path problem in meshes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4459","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:37ceb9bb50e1782b878094e806f3be560f89518e9948b3e724ebcb68a3a91eb4","target":"record","created_at":"2026-05-18T04:04:05Z","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":"c80200050313b038a6a1eb15ce3051a8ec2c6aacab94e07de8755e4ef5276577","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-21T10:39:34Z","title_canon_sha256":"21d3ddf0b67dc28a2a4a69a7eddf9609c2a053d84afea3d07bd90b605042a642"},"schema_version":"1.0","source":{"id":"1201.4459","kind":"arxiv","version":1}},"canonical_sha256":"927704720e473ecd7d42c4f0aa08d14d54bd9d38c95fd699ed97b33f325c3c30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"927704720e473ecd7d42c4f0aa08d14d54bd9d38c95fd699ed97b33f325c3c30","first_computed_at":"2026-05-18T04:04:05.996493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:05.996493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LHVQ/ktWZ7Je4JMOatdNo6anoAqk6WSbGYIH3YcuVvosuXtumFWMphJg0+qcCmsCTj/DydiApkSdLHErzs6QAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:05.997089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.4459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37ceb9bb50e1782b878094e806f3be560f89518e9948b3e724ebcb68a3a91eb4","sha256:80c2302c46e98b7fd582a80aad333f70fbb526db387f1fd24c5aedd94dbd199e"],"state_sha256":"fc5b04e01ef50fd00f18dd4dc048cacce3fdda6cedb6af65f8cb7ed913200cef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCcDs1hmlsO3wJUAfQi1CVszw8AGV+RkqizWiYhtZ7vOqirAcrKwiufePa4f+vgCzpuFq75JVpGzp6dvz8//Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T17:29:25.185686Z","bundle_sha256":"bfa30fd7eac3518445b99afaa4cde4fa05fafb52327d194796f652b43208e321"}}