{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AYEN24ZHMMCZATC4HWFCHCDS5X","short_pith_number":"pith:AYEN24ZH","schema_version":"1.0","canonical_sha256":"0608dd73276305904c5c3d8a238872ede123fafd00ff6555489ccab83accbe05","source":{"kind":"arxiv","id":"1707.07791","version":1},"attestation_state":"computed","paper":{"title":"Deep Feature Learning via Structured Graph Laplacian Embedding for Person Re-Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alexander G. Hauptmann, De Cheng, Nanning Zheng, Weiwei Shi, Yihong Gong, Zhihui Li","submitted_at":"2017-07-25T02:28:22Z","abstract_excerpt":"Learning the distance metric between pairs of examples is of great importance for visual recognition, especially for person re-identification (Re-Id). Recently, the contrastive and triplet loss are proposed to enhance the discriminative power of the deeply learned features, and have achieved remarkable success. As can be seen, either the contrastive or triplet loss is just one special case of the Euclidean distance relationships among these training samples. Therefore, we propose a structured graph Laplacian embedding algorithm, which can formulate all these structured distance relationships i"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1707.07791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-25T02:28:22Z","cross_cats_sorted":[],"title_canon_sha256":"8568bf1f6eaa05e471d2c38cfe696833c23bbe2082c4bb8da6f37666ebb4bcfd","abstract_canon_sha256":"19777cdab8df4929eca2fbb3777da5b5e0a81ae47da1b3a40d98cfbe85d37d9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:30.340049Z","signature_b64":"SOC+hHOEXvPiL7NR7CfeJY+OXkBMavS+DWQWFc/2tBxyB6+k+QLJnrULGO47n8VRUPU/UzxZae5Ou6iAzV0WDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0608dd73276305904c5c3d8a238872ede123fafd00ff6555489ccab83accbe05","last_reissued_at":"2026-05-18T00:39:30.339311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:30.339311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Feature Learning via Structured Graph Laplacian Embedding for Person Re-Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alexander G. Hauptmann, De Cheng, Nanning Zheng, Weiwei Shi, Yihong Gong, Zhihui Li","submitted_at":"2017-07-25T02:28:22Z","abstract_excerpt":"Learning the distance metric between pairs of examples is of great importance for visual recognition, especially for person re-identification (Re-Id). Recently, the contrastive and triplet loss are proposed to enhance the discriminative power of the deeply learned features, and have achieved remarkable success. As can be seen, either the contrastive or triplet loss is just one special case of the Euclidean distance relationships among these training samples. Therefore, we propose a structured graph Laplacian embedding algorithm, which can formulate all these structured distance relationships i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07791","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.07791","created_at":"2026-05-18T00:39:30.339456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07791v1","created_at":"2026-05-18T00:39:30.339456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07791","created_at":"2026-05-18T00:39:30.339456+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYEN24ZHMMCZ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYEN24ZHMMCZATC4","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYEN24ZH","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AYEN24ZHMMCZATC4HWFCHCDS5X","json":"https://pith.science/pith/AYEN24ZHMMCZATC4HWFCHCDS5X.json","graph_json":"https://pith.science/api/pith-number/AYEN24ZHMMCZATC4HWFCHCDS5X/graph.json","events_json":"https://pith.science/api/pith-number/AYEN24ZHMMCZATC4HWFCHCDS5X/events.json","paper":"https://pith.science/paper/AYEN24ZH"},"agent_actions":{"view_html":"https://pith.science/pith/AYEN24ZHMMCZATC4HWFCHCDS5X","download_json":"https://pith.science/pith/AYEN24ZHMMCZATC4HWFCHCDS5X.json","view_paper":"https://pith.science/paper/AYEN24ZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07791&json=true","fetch_graph":"https://pith.science/api/pith-number/AYEN24ZHMMCZATC4HWFCHCDS5X/graph.json","fetch_events":"https://pith.science/api/pith-number/AYEN24ZHMMCZATC4HWFCHCDS5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYEN24ZHMMCZATC4HWFCHCDS5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYEN24ZHMMCZATC4HWFCHCDS5X/action/storage_attestation","attest_author":"https://pith.science/pith/AYEN24ZHMMCZATC4HWFCHCDS5X/action/author_attestation","sign_citation":"https://pith.science/pith/AYEN24ZHMMCZATC4HWFCHCDS5X/action/citation_signature","submit_replication":"https://pith.science/pith/AYEN24ZHMMCZATC4HWFCHCDS5X/action/replication_record"}},"created_at":"2026-05-18T00:39:30.339456+00:00","updated_at":"2026-05-18T00:39:30.339456+00:00"}