{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PBQPOSEZWBIEATAKALGGEMTWPA","short_pith_number":"pith:PBQPOSEZ","schema_version":"1.0","canonical_sha256":"7860f74899b050404c0a02cc623276780d8220bd0ae0c5085e0b76673c5e02ce","source":{"kind":"arxiv","id":"1712.07150","version":1},"attestation_state":"computed","paper":{"title":"The planar Least Gradient problem in convex domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Ahmad Sabra, Piotr Rybka","submitted_at":"2017-12-19T19:08:03Z","abstract_excerpt":"We study the two dimensional least gradient problem in a convex, but not necessary strictly convex region. We look for solutions in the space of $BV$ functions satisfying the boundary data $f$ in trace sense. We assume that $f$ is in $BV$ too. We state admissibility conditions on the trace and on the domain that are sufficient for existence of solutions."},"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":"1712.07150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2017-12-19T19:08:03Z","cross_cats_sorted":[],"title_canon_sha256":"30ded01aae9a9f0f4a784b6e5e589fa10fb5aa688a9c096d594ccf142f4432e9","abstract_canon_sha256":"f3a337dbb4b0bb65106a260f54caa39f8bbd1a9e134d592f83109c58de4fa1b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:35.446757Z","signature_b64":"A83/+eoriFkLL7/94iqfwCiACCcmZQblApEBDN7QjJTW8XPo1jFNEKq58Rl69Kdrl/IIB6xBGJKvV7OUxMYPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7860f74899b050404c0a02cc623276780d8220bd0ae0c5085e0b76673c5e02ce","last_reissued_at":"2026-05-18T00:27:35.445882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:35.445882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The planar Least Gradient problem in convex domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Ahmad Sabra, Piotr Rybka","submitted_at":"2017-12-19T19:08:03Z","abstract_excerpt":"We study the two dimensional least gradient problem in a convex, but not necessary strictly convex region. We look for solutions in the space of $BV$ functions satisfying the boundary data $f$ in trace sense. We assume that $f$ is in $BV$ too. We state admissibility conditions on the trace and on the domain that are sufficient for existence of solutions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07150","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":"1712.07150","created_at":"2026-05-18T00:27:35.446023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07150v1","created_at":"2026-05-18T00:27:35.446023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07150","created_at":"2026-05-18T00:27:35.446023+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBQPOSEZWBIE","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBQPOSEZWBIEATAK","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBQPOSEZ","created_at":"2026-05-18T12:31:37.085036+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/PBQPOSEZWBIEATAKALGGEMTWPA","json":"https://pith.science/pith/PBQPOSEZWBIEATAKALGGEMTWPA.json","graph_json":"https://pith.science/api/pith-number/PBQPOSEZWBIEATAKALGGEMTWPA/graph.json","events_json":"https://pith.science/api/pith-number/PBQPOSEZWBIEATAKALGGEMTWPA/events.json","paper":"https://pith.science/paper/PBQPOSEZ"},"agent_actions":{"view_html":"https://pith.science/pith/PBQPOSEZWBIEATAKALGGEMTWPA","download_json":"https://pith.science/pith/PBQPOSEZWBIEATAKALGGEMTWPA.json","view_paper":"https://pith.science/paper/PBQPOSEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07150&json=true","fetch_graph":"https://pith.science/api/pith-number/PBQPOSEZWBIEATAKALGGEMTWPA/graph.json","fetch_events":"https://pith.science/api/pith-number/PBQPOSEZWBIEATAKALGGEMTWPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBQPOSEZWBIEATAKALGGEMTWPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBQPOSEZWBIEATAKALGGEMTWPA/action/storage_attestation","attest_author":"https://pith.science/pith/PBQPOSEZWBIEATAKALGGEMTWPA/action/author_attestation","sign_citation":"https://pith.science/pith/PBQPOSEZWBIEATAKALGGEMTWPA/action/citation_signature","submit_replication":"https://pith.science/pith/PBQPOSEZWBIEATAKALGGEMTWPA/action/replication_record"}},"created_at":"2026-05-18T00:27:35.446023+00:00","updated_at":"2026-05-18T00:27:35.446023+00:00"}