{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:B3ZZR32I5KA3FFH4DOYECUVDXA","short_pith_number":"pith:B3ZZR32I","canonical_record":{"source":{"id":"1901.06340","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-18T16:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"9b41c51db25ca8355c5beafa44406fbd167e790605e75e570259ecb830a1ba02","abstract_canon_sha256":"87aa434b3de574a80b0793e0261231922e9ea14c22627daa54e92aee9ebbc22d"},"schema_version":"1.0"},"canonical_sha256":"0ef398ef48ea81b294fc1bb04152a3b813a18492549f20ca30e719a72678e51e","source":{"kind":"arxiv","id":"1901.06340","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06340","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06340v2","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06340","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"B3ZZR32I5KA3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B3ZZR32I5KA3FFH4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B3ZZR32I","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:B3ZZR32I5KA3FFH4DOYECUVDXA","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06340","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-18T16:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"9b41c51db25ca8355c5beafa44406fbd167e790605e75e570259ecb830a1ba02","abstract_canon_sha256":"87aa434b3de574a80b0793e0261231922e9ea14c22627daa54e92aee9ebbc22d"},"schema_version":"1.0"},"canonical_sha256":"0ef398ef48ea81b294fc1bb04152a3b813a18492549f20ca30e719a72678e51e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:33.728894Z","signature_b64":"Pq+MzlYpCKklBc4QZ0lRzUXbjMfTuBtVhly3wnFSc3PVXmRHmQ6hGMBSwLRZMh/B20dX2+3nzh+83x+xN2xuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ef398ef48ea81b294fc1bb04152a3b813a18492549f20ca30e719a72678e51e","last_reissued_at":"2026-05-17T23:55:33.728276Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:33.728276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06340","source_version":2,"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-17T23:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fiU/KVAYOnOflxeUK2hI7gEXUmywpsnutJU+hYa5HUtwXvvwmkHT0kTx6pEUCvaJGubeDqnk2btXvYNwfj92Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:58:24.507871Z"},"content_sha256":"55e573f923835b1bc256bd0aac09c81acb293e61924ea577c869328e2055c75f","schema_version":"1.0","event_id":"sha256:55e573f923835b1bc256bd0aac09c81acb293e61924ea577c869328e2055c75f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:B3ZZR32I5KA3FFH4DOYECUVDXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feature Pyramid and Hierarchical Boosting Network for Pavement Crack Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Danil Prokhorov, Fan Yang, Haibin Ling, Lei Zhang, Sijia Yu, Xue Mei","submitted_at":"2019-01-18T16:58:59Z","abstract_excerpt":"Pavement crack detection is a critical task for insuring road safety. Manual crack detection is extremely time-consuming. Therefore, an automatic road crack detection method is required to boost this progress. However, it remains a challenging task due to the intensity inhomogeneity of cracks and complexity of the background, e.g., the low contrast with surrounding pavements and possible shadows with similar intensity. Inspired by recent advances of deep learning in computer vision, we propose a novel network architecture, named Feature Pyramid and Hierarchical Boosting Network (FPHBN), for pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06340","kind":"arxiv","version":2},"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-17T23:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCYPx1vFb+ngYMMpH9p6L+Cwig8szK9bbfTWBKU1hzybDqj+AzeHttI3ha5Wx+Tt+m5aBhQ9epkHc7ztmoDJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:58:24.508618Z"},"content_sha256":"77bb4ce5ba0a32fb3a2fded7b1b645d5d3ba50d919ab085b70e160f117b2c44e","schema_version":"1.0","event_id":"sha256:77bb4ce5ba0a32fb3a2fded7b1b645d5d3ba50d919ab085b70e160f117b2c44e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3ZZR32I5KA3FFH4DOYECUVDXA/bundle.json","state_url":"https://pith.science/pith/B3ZZR32I5KA3FFH4DOYECUVDXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3ZZR32I5KA3FFH4DOYECUVDXA/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-05-27T14:58:24Z","links":{"resolver":"https://pith.science/pith/B3ZZR32I5KA3FFH4DOYECUVDXA","bundle":"https://pith.science/pith/B3ZZR32I5KA3FFH4DOYECUVDXA/bundle.json","state":"https://pith.science/pith/B3ZZR32I5KA3FFH4DOYECUVDXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3ZZR32I5KA3FFH4DOYECUVDXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:B3ZZR32I5KA3FFH4DOYECUVDXA","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":"87aa434b3de574a80b0793e0261231922e9ea14c22627daa54e92aee9ebbc22d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-18T16:58:59Z","title_canon_sha256":"9b41c51db25ca8355c5beafa44406fbd167e790605e75e570259ecb830a1ba02"},"schema_version":"1.0","source":{"id":"1901.06340","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06340","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06340v2","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06340","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"B3ZZR32I5KA3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B3ZZR32I5KA3FFH4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B3ZZR32I","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:77bb4ce5ba0a32fb3a2fded7b1b645d5d3ba50d919ab085b70e160f117b2c44e","target":"graph","created_at":"2026-05-17T23:55: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"},"paper":{"abstract_excerpt":"Pavement crack detection is a critical task for insuring road safety. Manual crack detection is extremely time-consuming. Therefore, an automatic road crack detection method is required to boost this progress. However, it remains a challenging task due to the intensity inhomogeneity of cracks and complexity of the background, e.g., the low contrast with surrounding pavements and possible shadows with similar intensity. Inspired by recent advances of deep learning in computer vision, we propose a novel network architecture, named Feature Pyramid and Hierarchical Boosting Network (FPHBN), for pa","authors_text":"Danil Prokhorov, Fan Yang, Haibin Ling, Lei Zhang, Sijia Yu, Xue Mei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-18T16:58:59Z","title":"Feature Pyramid and Hierarchical Boosting Network for Pavement Crack Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06340","kind":"arxiv","version":2},"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:55e573f923835b1bc256bd0aac09c81acb293e61924ea577c869328e2055c75f","target":"record","created_at":"2026-05-17T23:55: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":"87aa434b3de574a80b0793e0261231922e9ea14c22627daa54e92aee9ebbc22d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-18T16:58:59Z","title_canon_sha256":"9b41c51db25ca8355c5beafa44406fbd167e790605e75e570259ecb830a1ba02"},"schema_version":"1.0","source":{"id":"1901.06340","kind":"arxiv","version":2}},"canonical_sha256":"0ef398ef48ea81b294fc1bb04152a3b813a18492549f20ca30e719a72678e51e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ef398ef48ea81b294fc1bb04152a3b813a18492549f20ca30e719a72678e51e","first_computed_at":"2026-05-17T23:55:33.728276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:33.728276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pq+MzlYpCKklBc4QZ0lRzUXbjMfTuBtVhly3wnFSc3PVXmRHmQ6hGMBSwLRZMh/B20dX2+3nzh+83x+xN2xuAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:33.728894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06340","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55e573f923835b1bc256bd0aac09c81acb293e61924ea577c869328e2055c75f","sha256:77bb4ce5ba0a32fb3a2fded7b1b645d5d3ba50d919ab085b70e160f117b2c44e"],"state_sha256":"93b36fd62c4b84e5e2d5874b3f396089e5af1afec647aad10e717ec15bd8a97d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKEeL7svjMyBib9PDLh0Ur8hikjEqUBweuufZ8P/hKLFP9eMUG8n2iXRH7RY9yFY7sHTogB+B13Fj3RUHZAiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:58:24.512614Z","bundle_sha256":"0983a639d4ac86f11169a64f65f683c47f18bd27509c88f917554bd5f418a3eb"}}